Routing methods, systems, and computer program products

ABSTRACT

In one embodiment, a non-transitory computer-readable media, a system, and methods are provided to: identify a policy, based on a first algorithm and a second algorithm, for use in constraining data routing from a first node to a third node; include a first sequence of identifiers and a second sequence of identifiers in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the third node via a plurality of network paths that each include at least one node in a label switching network or an Internet Protocol version 6 (IPv6) network; and provide path information that identifies the third sequence of identifiers, for constraining data routing, according to the policy, to the third node via a second node.

RELATED APPLICATIONS

The present application is a continuation of U.S. application Ser. No.15/961,818 filed Apr. 24, 2018 and entitled “Routing Methods, Systems,and Computer Program Products” which, in turn, is a continuation-in-partof U.S. application Ser. No. 14/274,632 filed May 9, 2014 and entitled“Methods, Systems, and Computer Program Products for Associating a Namewith a Network Path” (US 2014-0365682 A1) which, in turn, is acontinuation-in-part of: U.S. application Ser. No. 13/727,662 filed Dec.27, 2012 and entitled “Methods, Systems, and Computer Program Productsfor Routing Based on a Path-Based Protocol Address” (US 2014-0189156A1); U.S. application Ser. No. 13/727,651 filed Dec. 27, 2012 andentitled “Methods, Systems, and Computer Program Products for RoutingBased on a Nested Protocol Address” (US 2014-0189045 A1); U.S.application Ser. No. 13/727,652 filed Dec. 27, 2012 and entitled“Methods, Systems, and Computer Program Products for Routing Based on aScope-Specific Address” (US 2014-0189153 A1); U.S. application Ser. No.13/727,653 filed Dec. 27, 2012 and entitled “Methods, Systems, andComputer Program Products for Identifying a Protocol Address in aScope-Specific Address Space” (US 2014-0189159 A1); U.S. applicationSer. No. 13/727,655 filed Dec. 27, 2012 and entitled “Methods, Systems,and Computer Program Products for Determining a Shared Identifier for aHop in a Network” (US 2014-0189154 A1); and U.S. application Ser. No.13/727,657 filed Dec. 27, 2012 and entitled “Methods, Systems, andComputer Program Products for Determining a Protocol Address For a Node”(US 2014-0189155 A1).

Further, the present application incorporates by reference the followingapplications by reference in their entirety for all purposes: U.S.application Ser. No. 13/727,662 filed Dec. 27, 2012 and entitled“Methods, Systems, and Computer Program Products for Routing Based on aPath-Based Protocol Address” (US 2014-0189156 A1); U.S. application Ser.No. 13/727,651 filed Dec. 27, 2012 and entitled “Methods, Systems, andComputer Program Products for Routing Based on a Nested ProtocolAddress” (US 2014-0189045 A1); U.S. application Ser. No. 13/727,652filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer ProgramProducts for Routing Based on a Scope-Specific Address” (US 2014-0189153A1); U.S. application Ser. No. 13/727,653 filed Dec. 27, 2012 andentitled “Methods, Systems, and Computer Program Products forIdentifying a Protocol Address in a Scope-Specific Address Space” (US2014-0189159 A1); U.S. application Ser. No. 13/727,655 filed Dec. 27,2012 and entitled “Methods, Systems, and Computer Program Products forDetermining a Shared Identifier for a Hop in a Network” (US 2014-0189154A1); and U.S. application Ser. No. 13/727,657 filed Dec. 27, 2012 andentitled “Methods, Systems, and Computer Program Products forDetermining a Protocol Address For a Node” (US 2014-0189155 A1).

BACKGROUND

It is unlikely that the designers of the early network, which isreferred to as the “Internet” expected it to become as large as it hasbecome. The fact that the global Internet Protocol (IP) address spacefor 32-bit addresses has been fully allocated is evidence of this. Asthe Internet grows, new problems will arise and some current problemsare getting worse. For example, while network speeds and bandwidth areincreasing, so are causes of network latency.

The Internet Engineering Task Force (IETF) has taken steps at varioustimes in the past and are presently taking steps to address a number ofproblems resulting from the Internet's growth. Problems addressed by theIETF are described in a number of “Request for Comments” (RFC) documentspublished by the IETF. Documents referenced herein and included byreference include: “Request for Comments” (RFC) document RFC 791 editedby J. Postel, titled “Internet Protocol, DARPA Internet ProtocolSpecification”, published by the IETF in September, 1981; “Request forComments” (RFC) document RFC 1519 by V. Fuller, et al, titled “ClasslessInter-Domain Routing (CIDR): An Address Assignment and AggregationStrategy”, published by the Internet Engineering Task Force (IEFT), inJune, 1999; “Request for Comments” (RFC) document RFC 2460 by S.Deering, et al, titled “Internet Protocol, Version 6, (IPv6)Specification”, published by the IETF in December, 1998; “Request forComments” (RFC) document RFC 3513 by R. Hinden, et al, titled “InternetProtocol Version 6 (IPv6) Addressing Architecture”, published by theIETF in April, 2003; and “Request for Comments” (RFC) document RFC 2374by R. Hinden, et al, titled “Aggregatable Global Unicast AddressFormat”, published by the IETF in July, 1998.

RFC 791 states, “The internet protocol implements two basic functions:addressing and fragmentation”. RFC 791 goes on to state, “A distinctionis made between names, addresses, and routes. A name indicates what weseek. An address indicates where it is. A route indicates how to getthere. The internet protocol deals primarily with addresses. It is thetask of higher level (i.e., host-to-host or application) protocols tomake the mapping from names to addresses. The internet module mapsinternet addresses to local net addresses. It is the task of lower level(i.e., local net or gateways) procedures to make the mapping from localnet addresses to routes”.

As demonstrated in the RFCs listed above, addressing has been a sourceof a number of problems. In order to address a number of current andfuture problems facing the Internet, the subject matter described hereinchallenges the distinctions asserted in RFC 791 between and among names,addresses, and routes.

Accordingly, there exists a need for methods, systems, and computerprogram products for routing based on a path-based protocol address.

SUMMARY

The following presents a simplified summary of the disclosure in orderto provide a basic understanding to the reader. This summary is not anextensive overview of the disclosure and it does not identifykey/critical elements of the invention or delineate the scope of theinvention. Its sole purpose is to present some concepts disclosed hereinin a simplified form as a prelude to the more detailed description thatis presented later.

Methods and systems are described for routing based on a path-basedprotocol address.

In one embodiment, a non-transitory computer-readable media is providedfor storing instructions, that when executed by one or more processorsof a topology node, cause the topology node to: identify a firstsequence of identifiers for data routing in a label switching networkfrom a first node in the label switching network; identify a secondsequence of identifiers for data routing in the label switching networkfrom a second node in the label switching network; identify a policy foruse in constraining data routing from the first node to a third node;include the first sequence of identifiers and the second sequence ofidentifiers in a third sequence of identifiers that reflects the policysuch that data routing is constrained from the first node to the thirdnode via a plurality of network paths that each include at least onenode in the label switching network; and provide path information thatidentifies the third sequence of identifiers, for constraining datarouting, according to the policy, to the third node via the second node.

In another embodiment, a system is provided, comprising; network meansfor data routing; and topology node means for: identifying a firstsequence of identifiers for data routing in the network means from afirst node in the network means; identifying a second sequence ofidentifiers for data routing in the network means from a second node inthe network means; identifying a policy for use in constraining datarouting from the first node to a third node; including the firstsequence of identifiers and the second sequence of identifiers in athird sequence of identifiers that reflects the policy such that datarouting is constrained from the first node to the third node via aplurality of network paths that each include at least one node in thenetwork means; and providing path information that identifies the thirdsequence of identifiers, for constraining data routing, according to thepolicy, to the third node via the second node.

In yet another embodiment, a method is provided, comprising: at atopology node: identifying a first sequence of identifiers for datarouting in a label switching network from a first node in the labelswitching network; identifying a second sequence of identifiers for datarouting in the label switching network from a second node in the labelswitching network; identifying a policy for use in constraining datarouting from the first node to a third node; including the firstsequence of identifiers and the second sequence of identifiers in athird sequence of identifiers that reflects the policy such that datarouting is constrained from the first node to the third node via aplurality of network paths that each include at least one node in thelabel switching network; and providing path information that identifiesthe third sequence of identifiers, for constraining data routing,according to the policy, to the third node via the second node.

In still yet another embodiment, a method for configuring a topologynode is provided, comprising: communicatively coupling at least onenon-transitory memory and one or more processors; and causing storage ofthe instructions on the at least one non-transitory memory where theinstructions are configured to cause the topology node to: identify afirst sequence of identifiers for data routing in a label switchingnetwork from a first node in the label switching network; identify asecond sequence of identifiers for data routing in the label switchingnetwork from a second node in the label switching network; identify apolicy for use in constraining data routing from the first node to athird node; include the first sequence of identifiers and the secondsequence of identifiers in a third sequence of identifiers that reflectsthe policy such that data routing is constrained from the first node tothe third node via a plurality of network paths that each include atleast one node in the label switching network; and provide pathinformation that identifies the third sequence of identifiers, forconstraining data routing, according to the policy, to the third nodevia the second node.

BRIEF DESCRIPTION OF THE DRAWINGS

Objects and advantages of the present invention will become apparent tothose skilled in the art upon reading this description in conjunctionwith the accompanying drawings, in which like reference numerals havebeen used to designate like or analogous elements, and in which:

FIG. 1 is a block diagram illustrating an exemplary hardware deviceincluded in and/or otherwise providing an execution environment in whichthe subject matter may be implemented;

FIG. 2 is a flow diagram illustrating a method for routing based on apath-based protocol address according to an aspect of the subject matterdescribed herein;

FIG. 3 is a block diagram illustrating an arrangement of components forrouting based on a path-based protocol address according to anotheraspect of the subject matter described herein;

FIG. 4A is a block diagram illustrating an arrangement of components forrouting based on a path-based protocol address according to anotheraspect of the subject matter described herein;

FIG. 4B is a block diagram illustrating an arrangement of components forrouting based on a path-based protocol address according to anotheraspect of the subject matter described herein;

FIG. 4C is a block diagram illustrating an arrangement of components forrouting based on a path-based protocol address according to anotheraspect of the subject matter described herein;

FIG. 5A is a network diagram illustrating an exemplary system forrouting based on a path-based protocol address according to anotheraspect of the subject matter described herein;

FIG. 5B is a network diagram illustrating an exemplary system forrouting based on a path-based protocol address according to anotheraspect of the subject matter described herein;

FIG. 5C is a network diagram illustrating an exemplary system forrouting based on a path-based protocol address according to anotheraspect of the subject matter described herein;

FIG. 6A is a diagram illustrating an exemplary representation of apath-based protocol address according to another aspect of the subjectmatter described herein;

FIG. 6B is a diagram illustrating an exemplary representation of apath-based protocol address according to another aspect of the subjectmatter described herein;

FIG. 6C is a diagram illustrating an exemplary representation of apath-based protocol address according to another aspect of the subjectmatter described herein;

FIG. 6D is a diagram illustrating an exemplary representation of apath-based protocol address according to another aspect of the subjectmatter described herein;

FIG. 6E is a diagram illustrating an exemplary representation of apath-based protocol address according to another aspect of the subjectmatter described herein;

FIG. 7 is a flow diagram illustrating a method for determining aprotocol address for a node according to an aspect of the subject matterdescribed herein;

FIG. 8 is a block diagram illustrating an arrangement of components fordetermining a protocol address for a node according to another aspect ofthe subject matter described herein

FIG. 9 is a flow diagram illustrating a method for routing based on anested protocol address according to an aspect of the subject matterdescribed herein;

FIG. 10 is a flow diagram illustrating a method for routing based on ascope-specific address space according to an aspect of the subjectmatter described herein;

FIG. 11 is a flow diagram illustrating a method for identifying aprotocol address in a scope-specific address space according to anaspect of the subject matter described herein;

FIG. 12 is a block diagram illustrating an arrangement of components foridentifying a protocol address in a scope-specific address spaceaccording to another aspect of the subject matter described herein;

FIG. 13 is a flow diagram illustrating a method for identifying aprotocol address based on path information according to an aspect of thesubject matter described herein;

FIG. 14 is a block diagram illustrating an arrangement of components foridentifying a protocol address based on path information according toanother aspect of the subject matter described herein;

FIG. 15 is a flow diagram illustrating a method for assigning aninterface identifier to a network interface according to an aspect ofthe subject matter described herein; and

FIG. 16 is a block diagram illustrating an arrangement of components forassigning an interface identifier to a network interface according toanother aspect of the subject matter described herein.

DETAILED DESCRIPTION

One or more aspects of the disclosure are described with reference tothe drawings, wherein like reference numerals are generally utilized torefer to like elements throughout, and wherein the various structuresare not necessarily drawn to scale. In the following description, forpurposes of explanation, numerous specific details are set forth inorder to provide a thorough understanding of one or more aspects of thedisclosure. It may be evident, however, to one skilled in the art, thatone or more aspects of the disclosure may be practiced with a lesserdegree of these specific details. In other instances, well-knownstructures and devices are shown in block diagram form in order tofacilitate describing one or more aspects of the disclosure. It is to beunderstood that other embodiments and/or aspects may be utilized andstructural and functional modifications may be made without departingfrom the scope of the subject matter disclosed herein.

The use of “including”, “comprising”, “having”, and variations thereofare meant to encompass the items listed thereafter and equivalentsthereof as well as additional items and equivalents thereof. Terms usedto describe interoperation and/or coupling between components areintended to include both direct and indirect interoperation and/orcoupling, unless otherwise indicated. Exemplary terms used in describinginteroperation and/or coupling include “mounted,” “connected,”“attached,” “coupled,” “communicatively coupled,” “operatively coupled,”“invoked”, “called”, “provided to”, “received from”, “identified to”,“interoperated” and similar terms and their variants.

As used herein, any reference to an entity “in” an association isequivalent to describing the entity as “included in and/or identifiedby” the association, unless explicitly indicated otherwise.

Unless otherwise defined, all technical and scientific terms used hereinhave the same meaning as commonly understood by one of ordinary skill inthe art to which this disclosure belongs. Although methods, components,and devices similar or equivalent to those described herein can be usedin the practice or testing of the subject matter described herein,suitable methods, components, and devices are described below.

All publications, patent applications, patents, and other referencesmentioned herein are incorporated by reference in their entirety. Incase of conflict, the present disclosure, including definitions, willcontrol. In addition, the materials, methods, and examples areillustrative only and not intended to be limiting.

An exemplary device included in an execution environment that may beprogrammed, adapted, modified, and/or otherwise configured according tothe subject matter is illustrated in FIG. 1. An “execution environment”,as used herein, is an arrangement of hardware and, in some aspects,software that may be further modified, transformed, and/or otherwiseconfigured to include and/or otherwise host an arrangement of componentsto perform a method of the subject matter described herein. An executionenvironment includes and/or is otherwise provided by one or moredevices. The execution environment is said to be the executionenvironment “of” the device and/or devices. An execution environment maybe and/or may include a virtual execution environment including softwarecomponents operating in a host execution environment. Exemplary devicesincluded in and/or otherwise providing suitable execution environmentsthat may be adapted, programmed, and/or otherwise modified according tothe subject matter include a workstation, a desktop computer, a laptopor notebook computer, a server, a handheld computer, a mobile telephoneor other portable telecommunication device, a media playing device, agaming system, a tablet computer, a portable electronic device, ahandheld electronic device, a multiprocessor device, a distributedsystem, a consumer electronic device, a router, a network server, or anyother type and/or form of computing, telecommunications, network, and/ormedia device that is suitable to perform the subject matter describedherein. Those skilled in the art will understand that the componentsillustrated in FIG. 1 are exemplary and may vary by particular executionenvironment.

FIG. 1 illustrates a hardware device 100 included in an executionenvironment 102. FIG. 1 illustrates that execution environment 102includes a processor 104, such as one or more microprocessors; aphysical processor memory 106 including storage locations identified byaddresses in a physical memory address space of processor 104; apersistent secondary storage 108, such as one or more hard drives and/orflash storage media; an input device adapter 110, such as a key orkeypad hardware, a keyboard adapter, and/or a mouse adapter; an outputdevice adapter 112, such as a display and/or an audio adapter to presentinformation to a user; a network interface component, illustrated by anetwork interface adapter 114, to communicate via a network such as aLAN and/or WAN; and a mechanism that operatively couples elements104-114, illustrated as a bus 116. Elements 104-114 may be operativelycoupled by various means. Bus 116 may comprise any type of busarchitecture, including a memory bus, a peripheral bus, a local bus,and/or a switching fabric.

As used herein a “processor” is an instruction execution machine,apparatus, or device. A processor may include one or more electrical,optical, and/or mechanical components that operate in interpreting andexecuting program instructions. Exemplary processors include one or moremicroprocessors, digital signal processors (DSPs), graphics processingunits, application-specific integrated circuits (ASICs), optical orphotonic processors, and/or field programmable gate arrays (FPGAs).Processor 104 may access instructions and data via one or more memoryaddress spaces in addition to the physical memory address space. Amemory address space includes addresses identifying locations in aprocessor memory. The addresses in a memory address space are includedin defining a processor memory. Processor 104 may have more than oneprocessor memory. Thus, processor 104 may have more than one memoryaddress space. Processor 104 may access a location in a processor memoryby processing an address identifying the location. The processed addressmay be identified by an operand of an instruction and/or may beidentified by a register and/or other portion of processor 104.

FIG. 1 illustrates a virtual processor memory 118 spanning at least partof physical processor memory 106 and may span at least part ofpersistent secondary storage 108. Virtual memory addresses in a memoryaddress space may be mapped to physical memory addresses identifyinglocations in physical processor memory 106. An address space includingaddresses that identify locations in a virtual processor memory isreferred to as a “virtual memory address space”; its addresses arereferred to as “virtual memory addresses”; and its processor memory isreferred to as a “virtual processor memory” or “virtual memory”. Theterm “processor memory” may refer to physical processor memory, such asprocessor memory 106, and/or may refer to virtual processor memory, suchas virtual processor memory 118, depending on the context in which theterm is used.

Physical processor memory 106 may include various types of memorytechnologies. Exemplary memory technologies include static random accessmemory (SRAM), Burst SRAM or SynchBurst SRAM (BSRAM), Dynamic randomaccess memory (DRAM), Fast Page Mode DRAM (FPM DRAM), Enhanced DRAM(EDRAM), Extended Data Output RAM (EDO RAM), Extended Data Output DRAM(EDO DRAM), Burst Extended Data Output DRAM (BEDO DRAM), Enhanced DRAM(EDRAM), synchronous DRAM (SDRAM), JEDEC SRAM, PC 100 SDRAM, Double DataRate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), SyncLink DRAM (SLDRAM),Ferroelectric RAM (FRAM), RAMBUS DRAM (RDRAM) Direct DRAM (DRDRAM),and/or XDR™ DRAM. Physical processor memory 106 may include volatilememory as illustrated in the previous sentence and/or may includenon-volatile memory such as non-volatile flash RAM (NVRAM) and/or ROM.

Persistent secondary storage 108 may include one or more flash memorystorage devices, one or more hard disk drives, one or more magnetic diskdrives, and/or one or more optical disk drives. Persistent secondarystorage may include a removable data storage medium. The drives andtheir associated computer readable media provide volatile and/ornonvolatile storage for computer-executable instructions, datastructures, program components, and other data.

Execution environment 102 may include software components stored inpersistent secondary storage 108, in remote storage accessible via anetwork, and/or in a processor memory. FIG. 1 illustrates executionenvironment 102 including an operating system 120, one or moreapplications 122, and other program code and/or data componentsillustrated by other libraries and subsystems 124. In an aspect, some orall software components may be stored in locations accessible toprocessor 104 in a shared memory address space shared by the softwarecomponents. The software components accessed via the shared memoryaddress space may be stored in a shared processor memory defined by theshared memory address space. In another aspect, a first softwarecomponent may be stored in one or more locations accessed by processor104 in a first address space and a second software component may bestored in one or more locations accessed by processor 104 in a secondaddress space. The first software component is stored in a firstprocessor memory defined by the first address space and the secondsoftware component is stored in a second processor memory defined by thesecond address space.

Execution environment 102 may receive user-provided information via oneor more input devices illustrated by an input device 128. Input device128 provides input information to other components in executionenvironment 102 via input device adapter 110. Execution environment 102may include an input device adapter for a keyboard, a touch screen, amicrophone, a joystick, a television receiver, a video camera, a stillcamera, a document scanner, a fax, a phone, a modem, a network interfaceadapter, and/or a pointing device, to name a few exemplary inputdevices.

Input device 128 included in execution environment 102 may be includedin device 100 as FIG. 1 illustrates or may be external (not shown) todevice 100. Execution environment 102 may include one or more internaland/or external input devices. External input devices may be connectedto device 100 via corresponding network interfaces such as a serialport, a parallel port, and/or a universal serial bus (USB) port. Inputdevice adapter 110 may receive input and provide a representation to bus116 to be received by processor 104, physical processor memory 106,and/or other components included in execution environment 102.

An output device 130 in FIG. 1 exemplifies one or more output devicesthat may be included in and/or that may be external to and operativelycoupled to device 100. For example, output device 130 is illustratedconnected to bus 116 via output device adapter 112. Output device 130may be a display device. Exemplary display devices include liquidcrystal displays (LCDs), light emitting diode (LED) displays, andprojectors. Output device 130 presents output of execution environment102 to one or more users. In some embodiments, an input device may alsoinclude an output device. Examples include a phone, a joystick, and/or atouch screen. In addition to various types of display devices, exemplaryoutput devices include printers, speakers, tactile output devices suchas motion-producing devices, and other output devices producing sensoryinformation detectable by a user. Sensory information detected by a useris referred herein to as “sensory input” with respect to the user.

A device included in and/or otherwise providing an execution environmentmay operate in a networked environment communicating with one or moredevices via one or more network interface components. FIG. 1 illustratesnetwork interface adapter (NIA) 114 as a network interface componentincluded in execution environment 102 to operatively couple device 100to a network. A network interface component includes a network interfacehardware (NIH) component and optionally a network interface software(NIS) component. Exemplary network interface components include networkinterface controllers, network interface cards, network interfaceadapters, and line cards. A node may include one or more networkinterface components to interoperate with a wired network and/or awireless network. Exemplary wireless networks include a BLUETOOTHnetwork, a wireless 802.11 network, and/or a wireless telephony network(e.g., AMPS, TDMA, CDMA, GSM, GPRS UMTS, and/or PCS network). Exemplarynetwork interface components for wired networks include Ethernetadapters, Token-ring adapters, FDDI adapters, asynchronous transfer mode(ATM) adapters, and modems of various types. Exemplary wired and/orwireless networks include various types of LANs, WANs, and/or personalarea networks (PANs). Exemplary networks also include intranets andinternets such as the Internet.

The terms “network node” and “node” in this document both refer to adevice having a network interface component to operatively couple thedevice to a network. Further, the terms “device” and “node” used hereinrefer to one or more devices and nodes, respectively, providing and/orotherwise included in an execution environment unless clearly indicatedotherwise.

As used herein, the term “network protocol” refers to a set of rules,conventions, and/or schemas that govern how nodes exchange informationover a network. The set may define, for example, a convention and/or adata structure. The term “network path” as used herein refers to asequence of nodes in a network that are communicatively coupled totransmit data in one or more data units of a network protocol between apair of nodes in the network.

A “data unit”, as the term is used herein, is an entity specifiedaccording to a network protocol to transmit data between a pair of nodesin a network path to send the data from a source node to a destinationnode that includes an identified protocol endpoint of the networkprotocol. A network protocol explicitly and/or implicitly specifiesand/or otherwise identifies a schema that defines one or more of a rulefor a format for a valid data unit and a vocabulary for content of avalid data unit. One example of a data unit is an Internet Protocol (IP)packet. The Internet Protocol defines rules for formatting an IP packetthat defines a header to identify a destination address that identifiesa destination node and a payload portion to include a representation ofdata to be delivered to the identified destination node. Various addresstypes are specified defining a vocabulary for one or more addressportions of an IP data unit. The terms “data unit”, “frame”, “datapacket”, and “packet” are used interchangeably herein. One or more dataunits of a first network protocol may transmit a “message” of a secondnetwork protocol. For example, one or more data units of the IP protocolmay include a TCP message. In another example, one or more TCP dataunits may transmit an HTTP message. A message may be empty.

How data is packaged in one more data units for a network protocol mayvary as the data traverses a network path from a source node to adestination node. Data may be transmitted in a single data unit betweentwo consecutive nodes in a network path. Additionally, data may beexchanged between a pair of consecutive nodes in several data units eachincluding a portion of the data. Data received in a single data unit bya node in a network path may be split into portions included in severalrespective data units to transmit to a next node in the network path.Portions of data received in several data units may be combined into asingle data unit to transmit by a node in a network path. For purposesof describing the subject matter, a data unit in which data is receivedby a node is referred to as a different data unit than a data unit inwhich the data is forwarded by the node.

A “protocol address”, as the term is used herein, for a network protocolis an identifier of a protocol endpoint that may be represented in adata unit of the network protocol. For example, 192.168.1.1 is an IPprotocol address represented in a human readable format that may berepresented in an address portion of an IP header to identify a sourceand/or a destination IP protocol endpoint. A protocol address differsfrom a symbolic identifier, defined below, in that a symbolicidentifier, with respect to a network protocol, maps to a protocoladdress. Thus, “www.mynode.com” may be a symbolic identifier for a nodein a network when mapped to the protocol address 192.168.1.1. Anidentifier may be both a symbolic identifier and a protocol addressdepending on its role with respect to its use for a particular networkprotocol.

Since a protocol endpoint is included in a node and is accessible via anetwork via a network interface, a protocol address identifies a nodeand identifies a network interface of the node. A network interface mayinclude one or more NICs operatively coupled to a network.

A node in a pair of nodes in a network path at one end of the sequenceof nodes in the network path and/or the other end is referred to hereinas a “path end node”. Note that a node may have two NICs with one NIC ateach end of a network path. A network path may be included as a portionof another network path that communicatively couples a same pair ofnodes. Data may be transmitted via the sequence of nodes in a networkpath between path end nodes communicatively coupled via the networkpath. Data may be transmitted in one or both directions depending on anordering of the nodes in the sequence.

The term “hop” as used herein refers to a pair of consecutive nodes in anetwork path to transmit, via a network protocol, data sent from asource node to a destination node. A “hop path” is thus a sequence ofhops in a network that respectively include a sequence of pairs ofconsecutive nodes included in transmitting data from a first path endnode of the network path to a second path end node of the network path.

The term “path-based protocol address” as used herein refers to aprotocol address for a network protocol that includes one or more pathsegment identifiers that identify one or more respective portions of anetwork path identified by the path-based protocol address. A“node-based protocol address” is a path-based protocol address thatincludes a plurality of node identifiers that identify a sequence ofnodes in a network path. A “network-interface-based protocol address” isa path-based protocol address that includes a plurality of interfaceidentifiers that identify a sequence of network interfaces in a networkpath. A “NIC-based protocol address” is a type ofnetwork-interface-based protocol address that includes a plurality ofidentifiers that identify a sequence of network interface components. A“hop-based protocol address” is a type path-based protocol address sincea hop is a type of network path.

Given the above definitions, note that the terms “network path” and“hop” may be defined in terms of network interfaces. A “network path”and a “hop path” include a sequence of network interfaces in a networkthat are included in transmitting data between a pair of path end nodesin the network. A “hop” refers to at least part of a network path thatincludes a pair of consecutive network interfaces in a sequence ofnetwork interfaces in a network path. A “network path” is thus asequence of hops in a network that respectively includes a sequence ofpairs of consecutive network interfaces included in transmitting datafrom a first path end node of the network path to a second path end nodeof the network path.

The term “network topology” or “topology”, for short, as used hereinrefers to a representation of protocol endpoints and/or nodes in anetwork, and representations of hops representing communicativecouplings between and/or among the protocol endpoints and/or nodes inthe network. A network may have different network topologies withrespect to different network protocols. A network topology may representphysical communicative couplings between nodes in the network. A networktopology may represent logical couplings between protocol endpointsand/or nodes of a particular network protocol or a particular type ofnetwork protocol.

The domain name system (DNS) of the Internet operates based on anapplication layer protocol defined by the DNS. The nodes in the DNS arecommunicatively coupled via the DNS protocol and may be represented by alogical network topology. A DNS system includes nodes connected via theDNS protocol. The DNS system has a network topology defined by nodesthat include protocol endpoints of the DNS protocol. In still anotherexample, a token-ring network has a circular topology at the link layerbut may have a star topology at the physical layer.

As used herein, an “entity-specific address space” refers to an addressspace defined for a specific entity where the addresses in the addressspace operate as identifiers in the context of the entity. An addressfrom an entity-specific address space is referred to herein as an“entity-specific address”. An address is “entity-specific” in that whatit identifies is based on the entity to which it is specific. Anotheraddress having the same form and content may identify a different entitywhen in an address space specific to another entity. Addresses in anentity-specific address space operate as identifiers in the context ofan entity to which they are “specific” as defined by the specificassociation of the address space and the entity. Without knowledge ofthe entity to which an entity-specific address space is specific, whatan address in the entity-specific address space identifies isindeterminate. The terms “entity-specific address” and “entity-specificidentifier” are used interchangeably herein. An entity-specific addressmay identify an entity included in the entity to which the address isspecific or may identify an entity external to the entity to which theaddress is specific. The fact that an address is entity-specific doesnot define a scope for the address.

A portion of a network is a type of entity. A type of entity-specificaddress space described herein is a scope-specific address space. Asused herein, a “scope-specific address space”, specific to a particularregion of a network, is an address space defined for the particularnetwork region, where an address in the scope-specific protocol addressoperates as identifier, according to a network protocol, of a protocolendpoint in a node outside of the particular region when processed inthe context of a node in the particular region. The region is indicatedby the span of an indicated scope. The terms “region” and “zone” areused interchangeably herein. An address from a scope-specific addressspace is referred to herein as a “scope-specific protocol address”. Anaddress is “scope-specific” in that what protocol endpoint it identifiesdepends on the region to which it is specific. Another address havingthe exact same form and content may identify a different protocolendpoint when in an address space that is specific to another region. Aprotocol address in a scope-specific address space serves as anidentifier in the context of a node in a region to which thescope-specific address space is “specific” as defined by an associationof the address space and the region indicated by the scope. Withoutknowledge of the particular region to which a scope-specific addressspace is specific, what a scope-specific protocol address in thescope-specific address space identifies is indeterminate. The terms“scope-specific protocol address” and “scope-specific protocolidentifier” are used interchangeably herein. Types of scope-specificaddress spaces indicating exemplary spans include site-specific,LAN-specific, subnet-specific, city-specific, business-specific, andnode-specific.

For a network protocol, an address in a scope-specific address spaceserves as an identifier of a protocol endpoint in a node. Data may bereceived via the protocol endpoint from a network via one or morenetwork interfaces that operatively couple the node to the network. Datamay be sent via the protocol endpoint to transmit over the network viathe one or more network interfaces in the node. Since a protocolendpoint of a network protocol is included in a node and is accessiblevia a network via a network interface, a protocol address identifyingthe protocol endpoint also identifies the node and identifies a networkinterface of the node.

As used herein, a “node-specific address space” is a scope-specificaddress space defined for a specific node in a network, where theaddresses in the node-specific address space operate as identifiers ofnodes and/or network interfaces in the network when processed in thecontext of the specific node. An address from a node-specific addressspace is referred to herein as a “node-specific address”. An address is“node-specific” in that what it identifies depends on the node to whichis defined as specific. Another address having the exact same form andcontent may identify a different node when in an address space specificto another node. Addresses in a node-specific address space operate asidentifiers in the context of a node to which they are “specific” asdefined by the specific association of the address space and the node.Without knowledge of the node to which a node-specific address space isspecific, addresses in the node-specific address space areindeterminate. The terms “node-specific address” and “node-specificidentifier” are used interchangeably herein. A node-specific addressspace is a type of scope-specific address space.

The term “node” is defined above. Note that an identifier of a networkinterface in a network also identifies a node that includes the networkinterface. Thus, a network interface-specific address is also anode-specific address. Network interfaces in a node may have their ownrespective network interface-specific address spaces that are alsonode-specific. The network interface-specific address spaces may becombined to form a node-specific address space and/or may be managed asseparate address spaces. The adjectives “node-specific” and “networkinterface-specific” may be used interchangeably.

A scope-specific identifier differs from a scoped address as describedin “Request for Comments” (RFC) document RFC 4007 by S. Deering, et al,titled “IPv6 Scoped Address Architecture”, published by the IETF inDecember, 2006 and further described in application Ser. No. 11/962,285(published US 2009-0161576 A1), by the present inventor, filed on 2007Dec. 21, entitled “Methods and Systems for Sending Information to a zoneIncluded in an Internet Network” which, as set forth earlier, are bothincorporated by reference in their entirety. A scoped address space isshared by nodes in a given scope. While a link-local scoped address isspecific to a particular node, a link-local scoped address simplyidentifies a network interface component local to the particular node. Aloop-back internet address is specific to a node as well. Neitherlink-local scoped addresses nor loop-back addresses identify one node toanother. As such, neither serves as a node-specific identifier asdefined above.

A “scoped address” is described by RFC 3513 and RFC 4007 as anidentifier that, in a particular region of a network, serves as aprotocol address of a network interface and/or a node in the particularregion. The extent of the particular region is referred to as the scopeof the region and thus the scope within which the identifier serves as aprotocol address. A particular region included within a scope isindicated by its span. A scoped address is a valid protocol address onlywithin a particular region as indicated by the address's indicatedscope. Examples of scope indicators include node-scope where identifiersare valid only to a single node in the indicated span, LAN-scope whereidentifiers are valid for nodes in the span of a particular LAN, andsubnet-scope where identifiers are valid only for nodes in a particularsubnet. RFC 3513 currently defines support for link-local scope,site-local scope, and global scope. A data unit transmitted with ascoped address should not be delivered to node that does not have anetwork interface in the span indicated by the scope.

“Path information” is any information that identifies a network pathand/or a hop path for data transmitted via one or more specified networkprotocols. Path information may be identified by identifying networkinterfaces, NICs, nodes, and/or hops included in a network path.“Address information” is any information that identifies a protocoladdress that, for a network protocol, identifies a protocol endpoint.Address information may identify a unicast protocol address for anetwork protocol. In identifying a protocol endpoint, a protocol addressidentifies a node and a network interface.

Those skilled in the art will understand upon reading the descriptionsherein that the subject matter disclosed herein is not restricted to thenetwork protocols described and/or their corresponding OSI layers. Forease of illustration, the subject matter is described in terms ofprotocols that correspond to OSI layer three, also referred to asnetwork layer protocols, in general. Particular descriptions are basedon versions of the Internet Protocol (IP). Address information mayidentify one or more protocol addresses. Exemplary protocol addressesinclude IP addresses, IPX addresses, DECNet addresses, VINES InternetProtocol addresses, and Datagram Delivery Protocol (DDP) addresses, HTTPURLS, TCP port and IP address pairs, and the like.

The term “path-based address” is defined above. A “node-based address”is a path-based address where some or all of the address includes nodeidentifiers that identify a sequence of nodes in a network path. A“network-interface-based address” is a path-based address where some orall of the address includes identifiers of network interfaces in asequence in a network path. A “NIC-based address” is a type ofnetwork-interface-based address that identifies a sequence of networkinterface components. A “hop-based address” is a path-based addresswhere some or all of the address identifies one or more hops in anetwork path. The protocol address types defined are not mutuallyexclusive.

The term “metric space”, as used herein, refers to a set, as defined inmathematics, where a distance between elements of the set is definedaccording to a metric. Metric spaces defined in Euclidean geometry arewell-known examples. Those skilled in the art of metric spaces, such asEuclidian spaces, will appreciate that a one-to-one mapping may bedetermined and/or otherwise identified for mapping addresses from afirst coordinate space having a first origin for a metric space toaddresses from a second coordinate space having a second origin in themetric space. Given a mapping rule between a first scope-specificaddress space and a second scope-specific address space and a mappingbetween the second scope-specific address space and a thirdscope-specific address space based on a third coordinate spaceidentifying a third origin in the metric space, a mapping from the firstcoordinate space to the third coordinate space may be determined. Amapping between coordinate spaces for a metric space may be included acoordinate shift and/or a rotation, for example. The mapping may bepre-specified and accessible to the nodes in one or both address spaces.Mapping between locations in a number of different metric spaces is wellknown in mathematics. For example, a top half of the surface of spheremay be mapped to a plane. Some will further appreciate that some metricspaces may be mapped to other metric spaces. Some of these mappings areone-to-one and/or onto.

FIG. 3 illustrates an arrangement of components in a system thatoperates in an execution environment, such as execution environment 102in FIG. 1. The arrangement of components in the system operates toperform the method illustrated in FIG. 2. The system illustratedincludes an in-data handler component 302, a routing component 304, aforwarding component 306, and an out-data handler component 308. Theexecution environment includes a processor, such as the processor 104,to process an instruction, during operation of the system, in at leastone of the in-data handler component 302, the routing component 304, theforwarding component 306, and the out-data handler component 308.

Some or all of the exemplary components illustrated in FIG. 3 may beadapted to perform the method illustrated in FIG. 2 in a number ofexecution environments. FIG. 4A, FIG. 4B, and FIG. 4C are each blockdiagrams illustrating the components of FIG. 3 and/or analogs of thecomponents of FIG. 3 respectively adapted to operate in an executionenvironment 401 a, in an execution environment 401 b, and in anexecution environment 401 c that are included in and/or that otherwiseare provided by one or more nodes.

Components, illustrated in FIG. 4A, FIG. 4B, and FIG. 4C, arerespectively identified by a number followed with an alphanumericsuffix. A component may be referred to generically in the singular orthe plural by dropping a suffix of a portion thereof of the component'sidentifier. For example, execution environments; such as the executionenvironment 401 a, the execution environment 401 b, the executionenvironment 401 c, and their adaptations and analogs; are referred toherein generically as an execution environment 401 or, when describingmore than one, execution environments 401. Other components identifiedwith a suffix may similarly be referred to generically or as a group bydropping a suffix or a portion thereof.

FIG. 1 illustrates key components of an exemplary device that may atleast partially provide and/or otherwise be included in an executionenvironment. Some or all of the components illustrated in FIG. 4A, FIG.4B, and FIG. 4C may be included in and/or otherwise may be combined withthe components of FIG. 1 to create a variety of arrangements ofcomponents according to the subject matter described herein. Thoseskilled in the art will understand other execution environments inaddition to the various adaptations of the execution environmentsdescribed herein are suitable for hosting an adaptation of thearrangement in FIG. 3.

FIGS. 5A-C respectively illustrate networks 500 including nodes that invarious aspects may include adaptations of any of the executionenvironments 401, illustrated in FIG. 4A, FIG. 4B, and FIG. 4C. Thevarious illustrated nodes are operatively coupled via respective networkinterface components to the respective networks 500 in FIGS. 5A-C. Forease of illustration and description, each of FIGS. 5A-C includes nodesidentified by a role played in sending data from one node to another.FIGS. 5A-C illustrate source nodes 502 configured to initiate atransmission of data to respective recipients, path nodes 504 configuredto relay the data transmitted by respective source nodes 502, anddestination nodes 506 identified by the respective source nodes 502 asrecipients of the data from source nodes 502. In some of FIGS. 5A-C, oneor more edge nodes 508 are illustrated for describing adaptations of thearrangement in FIG. 3 performing various aspects of the methodillustrated in FIG. 2 operating in one or more of the roles identified.

A network interface includes one or more NICs identified by a protocoladdress of a network protocol for sending data from a protocol endpointidentified by the network protocol and/or for receiving data for theprotocol endpoint.

In various contexts nodes illustrated as destination nodes 506, edgenodes 508, and/or path nodes 504 may operate as source nodes; some nodesillustrated as source nodes 502, edge nodes 508, and destination nodes506 may operate as path nodes, and nodes illustrated as source nodes502, edge nodes, 508, and/or path nodes 504 may operate as destinationnodes. Exemplary nodes configured to operate as path nodes 504 include arouter, a switch, a wireless access point, a bridge, a gateway, and thelike.

A path node 504 illustrated in any of FIGS. 5A-C and/or a node otherwiseoperating as a path node may include an adaptation of any executionenvironment 401 illustrated in FIG. 4A, FIG. 4B, and/or FIG. 4C. A pathnode 504 may include a first network interface component and a secondnetwork interface component. With respect to FIG. 5B, a first path node504 b 1 may be operatively coupled to a first network 514 b 1 includedin a network 500 b via a first network interface component and may beoperatively coupled to a second network 514 b 2 via a second networkinterface component. The first path node 504 b 1 may forward data sentfrom a source node 502 b in the first network 514 b 1 for delivery via asecond network 514 b 2 to a destination node 506 b in a third network514 b 3. The first network 514 b 1, the second network 514 b 2, and/orthe third network 514 b 3 may respectively include and/or may beincluded in a local area network (LAN), an intranet, at least a portionof the Internet, and/or another wide area network (WAN).

The network components in some nodes may be configured according to alayered design or architecture known to those skilled in the art as a“network stack”. Adaptations and/or analogs execution environments 401in FIG. 4A, FIG. 4B, and FIG. 4C may include network components in alayered architecture, physically and/or logically. Other architecturalmodels for network components may be included in other executionenvironments to send and/or receive data via a network and areconsidered within the scope of the subject matter described herein.Combinations of layered architectures and non-layered architectures arealso considered to be within the scope of the subject matter describedherein.

Some components illustrated in FIG. 4A correspond to components of thelayered architecture specified by the Open System Interconnection (OSI)model, known to those skilled in the art. For example, networkcomponents in FIG. 4A may comply with specifications for protocolsincluded in the TCP/IP protocol suite. The OSI model specifies aseven-layer network stack. The TCP/IP protocol suite may be mapped tolayer three and layer four of the seven layers. Those skilled in the artwill understand that fewer or more layers may be included in variousadaptations and analogs of the execution environments 401 illustrated inFIG. 4A, FIG. 4B, FIG. 4C, and their various aspects described herein;and for any other execution environment suitable for hosting anadaptation and/or analog of the arrangement of components illustrated inFIG. 3.

FIG. 4A illustrates a network layer component 403 a that corresponds tolayer 3 of the open systems interconnection reference (OSI) model. TheInternet Protocol (IP) is an exemplary layer 3 protocol, also referredto as a network layer protocol. FIG. 4A illustrates a first NIC 405 a 1configured to operatively couple a node including an adaptation and/oranalog of the execution environment 401 a to a network. One or more NICs405 a correspond to layer one, also known as the physical layer, of theOSI model for receiving and sending signals via a physical datatransmission medium. Exemplary network layer protocols include anInternet Protocol (IP), DECNet routing Protocol (DRP), an InternetworkPacket Exchange (IPX) protocol, an Internet Datagram Protocol (IDP), aVINES Internet Protocol, and a Datagram Delivery Protocol (DDP).

FIG. 4A also illustrates a link layer component 407 a that correspondsto layer 2, also known as the link layer, of the OSI model forcommunicating, via layer 1, between nodes sharing a physical datatransmission medium such as nodes in a LAN.

Exemplary link layer protocols include an Ethernet protocol, aToken-ring protocol, and asynchronous transfer mode (ATM) protocol, toname a few. Some or all of a link layer component 407 a may be includedin one or more NICs 405, as illustrated in FIG. 4A. A portion of a linklayer component may be external to and operatively coupled to one ormore NICs. The external portion may be realized, at least in part, as adevice driver for the one or more NICs. Exemplary physical datatransmission media include Ethernet cables of various types, co-axialcables, fiber optic cables, and media suitable for transporting varioustypes of wireless signals. FIG. 4A illustrates that some nodes includedin and/or otherwise providing an adaptation and/or analog of theexecution environment 401 a may include more than two NICs 405 a, asillustrated by a third NIC 405 a 3 through an Nth NIC 405 an.

The network layer component 403 a, illustrated in FIG. 4A, may operateto communicate across various types of link layer protocols, in variousadaptations. Layer 3 protocols enable data to be exchanged between andamong nodes on different networks across different types of physicaldata transmission media and differing link layer protocols. The InternetProtocol (IP) in the TCP/IP protocol suite is the most widely utilizednetwork layer protocol currently in use. For ease of illustration, thedescription that follows provides examples based on IP networks andprotocols in the TCP/IP suite due to their wide use and because they arewell known in the art. Those skilled in the art will understand that thescope of the subject matter described is not limited to IP networks.

In addition to the protocols described above, protocols corresponding tolayers in the OSI model above the network layer may be included incommunicating via a network. The term “application protocol” as usedherein refers to any protocol or combination of protocols thatcorrespond to one or more layers in the OSI reference model above thenetwork layer. Programs and executables operating in executionenvironments 401 may communicate via one or more application protocols.Exemplary application protocols include the transmission controlprotocol (the TCP) in the TCP/IP suite, the user datagram protocol (UDP)in the TCP/IP suite, various versions of hypertext transfer protocol(HTTP), various remote procedure call (RPC) protocols, various instantmessaging protocols, various email protocols, and various otherprotocols for real-time communications. Data exchanged between nodes ina network may be exchanged via data units of one or more networkprotocols. An execution environment may include layer specific protocolcomponents respectively configured according to the one or more networkprotocols. Some protocols and/or protocol components may define and/orprovide services from multiple layers of the OSI model layer such as theSystems Network Architecture (SNA) protocol.

In addition to specifying schemas defining valid data units, a networkprotocol may define and/or otherwise be associated with a definedidentifier space for identifying protocol endpoints defined according tothe network protocol. The terms “identifier space” and “address space”are used interchangeably herein. For example, various versions ofhypertext transfer protocol (HTTP) specify a format for HTTP uniformresource locators (URL). HTTP specifies a location in an HTTP headerthat identifies a URL as an identifier or address from the HTTP addressspace that identifies both a resource and recipient of an HTTP dataunit. The transmission control protocol (TCP) specifies a format andvocabulary for a TCP header including a destination protocol endpointidentifier field referred to as a destination port number that, whencombined with a destination protocol address from an IP packet,identifies a transport layer protocol endpoint of a receiver of datasent in a TCP data unit via a network. A source protocol endpoint issimilarly identified by a source port number, included in a TCP headeras defined by the TCP, along with a source protocol address from an IPdata unit as defined by the Internet Protocol.

Other exemplary address spaces that identify protocol endpoints invarious network protocols include an email address space, a telephonenumber address space for various telephony protocols, instant messageaddress spaces for various instant message protocols, and media accesscontrol (MAC) addresses for various link layer protocols, to name just afew examples. The address spaces identified are shared among the sendersand receivers exchanging data via any particular protocol from amongthose identified herein as well as others that are known. Some addressspaces are shared by senders and receivers in a LAN, an intranet, and/orin another identifiable portion of a network. Other address spaces areshared globally. For example, the HTTP identifier space is a globaladdress space shared across the Internet. An HTTP identifier is definedto identify the same resource regardless of the application and/or nodeidentifying the resource via the HTTP identifier. An HTTP URL is aglobal identifier in an HTTP network, such as the World Wide Web (Web).Addresses in a shared address space are referred to as scoped addressesthat serve as identifiers of protocol endpoints in nodes that share theaddress space in a region of a network defined by a scope.

In delivering data via a network between protocol endpoints of aparticular network protocol, addresses from address spaces of thevarious protocols at the various layers are typically translated and/orotherwise mapped between the various layers. For example, a unicast IPaddress in an IP packet is mapped to a link layer address for a link viawhich the IP packet is transported in a network path via a path node 504in relaying data from a source node 502 to an identified destinationnode 506. Addresses at the various layers are assigned from a suitableaddress space for corresponding network protocols.

FIG. 5B illustrates data may be received via the protocol endpoint froma network via one or more network interfaces that operatively couple anode to the network. Data may be sent via the protocol endpoint in atransmission over the network via the one or more network interfaces inthe node. In FIG. 5B, a network path communicatively coupling the sourcenode 502 b and a second edge node 508 b 2 in the network 500 b includesa sequence of nodes including of the source node 502 b, a first pathnode 504 b 1, and the second edge node 508 b 2. In FIG. 5C, a firstnetwork path communicatively coupling a fifth edge node 508 c 5 and aneighth path node 504 c 8 includes a first sequence of nodes includingthe fifth edge node 508 c 5, a ninth path node 504 c 9, and the eighthpath node 504 c 8. The first network path is included in a secondnetwork path communicatively coupling the fifth edge node 508 c 5 andthe second edge node 508 c 2 that includes a second sequence of nodesincluding of the nodes in the first sequence, a seventh path node 504 c7, and the second edge node 508 c 2. A network path may be physicalnetwork path or logical network path based on a particular networkprotocol defining protocol endpoints in the path end nodes.

FIG. 5B, illustrates a number of network paths communicatively couplingthe source node 502 b and the destination node 506 b in the network. Onenetwork path illustrated includes a sequence of hops including a firsthop 512 b 1, a sixth hop 512 b 6, and a seventh hop 512 b 7. In FIG. 5C,the first network path described above communicatively coupling thefifth edge node 508 c 5 and the eighth path node 504 c 8 includes afirst sequence of hops including a first hop 512 c 1 and a second hop512 c 2. A hop may be a physical hop or a logical hop based on a networkprotocol defining a network topology in which the hop is identifiedand/or otherwise represented.

Given the above definitions, note that the terms “network path” and“hop” may be defined in terms of network interfaces. A “network path” isa sequence of network interfaces in a network for transmitting data inone or more data units of a specified network protocol between a pair ofpath end nodes in the network. A “hop” refers to a pair of consecutivenetwork interfaces, in a pair of nodes, in a sequence of networkinterfaces in a network path. A hop in a sequence in a network pathcorresponds to a pair of network interfaces in the sequence of networkinterfaces in the network path. In FIG. 5B, the network path describedabove communicatively coupling the source node 502 b and the destinationnode 506 b includes a sequence of network interfaces including a networkinterface in the first path node 504 b 1 in the first hop 512 b 1, anetwork interface in a second path 504 b 2 in a sixth hop 512 b 6, andnetwork interface in the destination node 506 b in a seventh hop 512 b7. The network paths in FIG. 5C described above may also be described asa sequence of network interfaces.

A network topology may represent logical hops in a network. In FIG. 5B,the first network 514 b 1 may represented a physical topology when thefirst 514 b 1 represents a physical data transmission medium included inphysically coupling nodes. The data transmission medium may be atoken-ring LAN, for example. The hops 512 in FIG. 5, may illustratelogical communicative couplings at a level of the network above the datatransmission medium. The hops 512 may represent network layer hops orhops at some other layer of the network above the physical layer. Thedomain name system (DNS) of the Internet provides another example ofnodes in a logical network topology based on DNS protocol endpoints ofthe DNS protocol that identifies nodes in the Internet included thenetwork topology. Hops in a DNS based network topology correspond tocommunicative couplings enabled by the DNS protocol.

With reference to FIG. 2, a block 202 illustrates that the methodincludes detecting, by a current node in a current location in a networkpath, data in a data unit that is specified according to a networkprotocol and that includes a first path-based protocol address includinga plurality of path segment identifiers that identify respective pathsegments of a network path for transmitting data from a source node to adestination node. Accordingly, a system for routing based on apath-based protocol address includes means for detecting, by a currentnode in a current location in a network path, data in a data unit thatis specified according to a network protocol and that includes a firstpath-based protocol address including a plurality of path segmentidentifiers that identify respective path segments of a network path fortransmitting data from a source node to a destination node. For example,the arrangement illustrated in FIG. 3, includes the in-data handlercomponent 302 that is operable for and/or otherwise is included indetecting, by a current node in a current location in a network path,data in a data unit that is specified according to a network protocoland that includes a first path-based protocol address including aplurality of path segment identifiers that identify respective pathsegments of a network path for transmitting data from a source node to adestination node. FIGS. 4A-C illustrate in-data handler components 402as adaptations and/or analogs of the in-data handler component 302 inFIG. 3. One or more in-data handler components 402 operate in anexecution environment 401. In FIG. 4A, an in-data handler component 402a is included in network layer component 403 a. In FIG. 4B and in FIG.4C, in-data handler components 402 operate in respective line cardcomponents 409.

In transmitting data from a source protocol endpoint in a source node502 to a destination protocol endpoint in a destination node 506, thedata is processed by a sequence of nodes in a network path thatcommunicatively couples the source node 502 and the destination node506. A node in the network path, that is currently processing the datato send it to the destination 506, is referred to herein as a “currentnode” with respect to the data. A node in the network path that haspreviously transmitted the data being processed by the current node isreferred to herein as a “previous node”. A node in the network path thathas not received the data being processed by the current node isreferred to herein as a “next node”. For ease of description, withrespect to a data unit “data” refers to data sent in the data unit via aprotocol endpoint in the source node, that is being processed by acurrent node. As such, a source node 502 may be a current node or aprevious node with respect to particular data. A path node 504 may be acurrent node, a previous node, or a next node with respect to theparticular data. A destination node 506 may be a next node or a currentnode with respect to particular data.

A source node 502 may be a current node with respect to data to betransmitted to a destination node 506. The source node 502 may includean adaptation, analog, and/or instance of the execution environment 401a in FIG. 4A. An in-data handler component 402 a operating in a networklayer component 403 a in the source node 502 may detect the data. Thenetwork layer component 403 a may be configured according to a networklayer protocol, such as a version of the Internet Protocol. The in-datahandler component 402 a may detect data in a data unit that is to besent to the destination node 506. The data may be received from anapplication or other type of component configured to send data via anetwork to a recipient. For example, the application component may be anemail client, a file transfer application, a network management client,and the like to be transmitted via one or more data units of the networkprotocol of the network layer component 403 a. The in-data handler 402 amay receive the data, directly and/or indirectly, from the applicationin the source node 502. The in-data handler 402 may interoperate with anout-data component 408 a and/or other component of the network layercomponent 403 a to include and/or otherwise detect the data in a dataunit of the network protocol.

A path node 504 may include an adaptation, analog, and/or instance ofthe execution environment 401 a, illustrated in FIG. 4A. Datacommunicated between a source node 502 and a destination node 506 may bereceived by the path node 504 via of a first NIC 405 a 1 operativelycoupling the path node 504 to a previous network path including thesource node 502 and the path node 504 as path end nodes. One or morelink layer protocol data units may be detected by a link layer component407 a according to a compatible link layer protocol. For example,Ethernet frames may be detected as link layer protocol data units whenreceived via a CAT 6 Ethernet cable. Data in a received link layerprotocol data unit may be provided to an in-data handler component 402 ain a network layer component 403 a according to the specification of aparticular network layer protocol, such as the IP.

An in-data handler component 402 a may detect one or more network layerprotocol data units in data received from the link layer component 407a. For example, the in-data handler component 402 a may detect one ormore IP packets in data received in one or more Ethernet frames. Thein-data handler component 402 a may detect a network layer data unitthat includes data from the source node 502 to relay the data to thedestination node 506 identified by a protocol address in addressinformation in the detected network layer data unit as defined by aparticular network layer protocol supported by the network layercomponent 403 a in the path node 504. A network interface component 405a in a path node 504 may receive data communicated from a source node502 via a previous network path included in a network 500. One or morenetwork paths may exist to receive the data. A path node 504 may receivedata from a source node 502 and may transmit the received data to adestination node 506 via a specified protocol. For example, a path node504 may receive and transmit data in one or more data packets at a linklayer as performed by an Ethernet bridge and a multipleprotocol-labeling switch (MPLS). Further, a path node 504 may receiveand transmit data in one or more data packets at a network layer asperformed by an Internet protocol (IP) router. Still further, a pathnode 504 may receive and transmit data in one or more data packets at anapplication layer, as defined above.

Accordingly, data from a source node 502 may be included in and/or mayinclude data formatted according to a link layer protocol, a networklayer protocol, and/or an application layer protocol. An in-data handlercomponent 402 a may be configured according to a network layer protocol,a link layer protocol, and/or an application layer protocol.

A network protocol defines one or more of a format defining a validstructure for a data unit and a vocabulary defining valid content of thedata unit. For example, data to transmit from a source node to adestination node may be included in a payload portion of a data unit ofa particular network protocol. The network protocol may define a formatthat identifies the payload based on one or more valid data structuresfor a data unit. For example, a payload portion may be identified by alocation with respect to the start of a data unit or relative to anotherportion of the data unit. Alternatively or additionally, the networkprotocol may define a vocabulary defining a keyword, a bit pattern,and/or other detectable marker that when detected identifies a payloador part of a payload in a data unit. The network protocol may define oneor more format rules and/or vocabulary rules that an in-data handlercomponent may detect in identifying data and/or address information in adata unit. The term “schema” refers to a definition of a structureand/or a vocabulary for constructing and/or detecting a valid data unitwith respect to a network protocol. For example, both an IPv4 datapacket and an IPv6 data packet are specified according to a schema forincluding address information in a destination protocol address fieldand in a source protocol address field in an IP header based on locationand size.

Data received from a source node 502 by a path node 504 may be receivedvia one or more previous path nodes 504. Data may be received by acurrent node 504 from a previous node based on a previous-current pathsegment identifier included in a path-based protocol address thatidentifies a destination node 506. The previous-current path segmentidentifier identifies a network path from the previous node to thecurrent node for transmitting the data.

Returning to FIG. 2, a block 204 illustrates that the method furtherincludes detecting, based on the current location, a current-next pathsegment identifier that identifies a current-next path segment in theplurality for transmitting the data from the current node to a next nodein the network path. Accordingly, a system for routing based on apath-based protocol address includes means for detecting, based on thecurrent location, a current-next path segment identifier that identifiesa current-next path segment in the plurality for transmitting the datafrom the current node to a next node in the network path. For example,the arrangement illustrated in FIG. 3, includes the routing component304 that is operable for and/or otherwise is included in detecting,based on the current location, a current-next path segment identifierthat identifies a current-next path segment in the plurality fortransmitting the data from the current node to a next node in thenetwork path. FIGS. 4A-C illustrate routing components 404 asadaptations and/or analogs of the routing component 304 in FIG. 3. Oneor more routing components 404 operate in an execution environment 401.

In FIG. 4A, a routing component 404 a is illustrated as a component of anetwork layer component 403 a. In FIG. 4B, a routing component 404 b isillustrated operatively coupled to multiple line card components 409 bto relay data between and/or among portions of a network coupled to theline cards 409 b. Routing component 404 b may operate at a network layerof a network stack and/or at another layer. In FIG. 4C, a routingcomponent 404 c is illustrated as distributed throughout line cardcomponents 409 c of an execution environment 401 c. The routingcomponent in the execution environment 401 c includes a first routingagent (RA) component 404 c 1 in a first line card component 409 c 1 anda second RA component 404 c 2 in a second line card component 409 c 2.

FIGS. 6A-E illustrate a number of types of address representations 602illustrating aspects of various address formats and vocabularies forrepresenting a path-based protocol address. Various portions of therespective address representations 602 are illustrated as contiguous butneed not be so in various embodiments. The address representations 602in FIGS. 6A-E may be identified based on an aspect of a format of a dataunit and/or an aspect of a vocabulary of a data unit as defined by aschema of a network protocol. Routing component 404 a may detect aprotocol address of a next node based on a schema for including addressinformation in a data unit of a network protocol. In another aspect,address information may be detected by an in-data handler component 402a configured to provide some or all of the address information to therouting component 404 a to detect a protocol address of a next node in apath-based protocol address in the address information.

Address representations 602 in FIGS. 6A-E are described with respect totheir inclusion in data units of a network protocol. Each of the addresstypes shown in FIGS. 6A-E may be adapted to be included in a destinationprotocol address portion and/or a source protocol address portion of anIPv4 packet header and/or of an IPv6 packet header. Each may beidentified as a path-based protocol address, by a routing component 404a, by a bit pattern and/or other type identifier defined to identify aprotocol address type as a path-based protocol address type. The bitpattern or identifier may be located by the routing component 404 astored in a type bits portion of an IP packet and/or in some otherspecified location. Those skilled in the art will realize that neitherthe schemas, which define a format rule(s) and/or a vocabulary rule(s)for a protocol address, described nor the protocols in which their useis described are exhaustive.

FIG. 6A illustrates an address representation 602 a that may be detectedby an in-data handler component 402 a and/or a routing component 404 ain a data unit or packet of an Internet Protocol or other network layerprotocol. An address representation 602 a may identify a path-basedprotocol address identifying multiple path segments in a network pathfor transmitting data from a source node to a destination node via thenetwork path. In an aspect, an address representation 602 a may beprocessed by an in-data handler component 402 a and/or a routingcomponent 404 a as including multiple portions. An address informationfield 606 a may include a path-based protocol address that identifiesthe destination node and/or the source node. An address separator field604 a is illustrated, in FIG. 6A, including a binary number. Theexemplary binary number equals seventeen in FIG. 6A. The value in theaddress separator field 604 a may be defined to identify the size in theaddress information field 606 a of a previous address field 608 a toidentify the previous address field 608 a and a next address field 610a. A routing component 404 a, in a current node 504, may processinformation in a previous address field 608 a to identify aprevious-current path segment identifier, in the path-based protocoladdress, that identifies the current node 504 with respect to a previousnode in the network path. A routing component 404 a may identify, basedon information in a next address field 610 a, a current-next pathsegment identifier, in the path-based protocol address, that identifiesa next node in the network path. In FIG. 6A previous portion 608 a 2 maybe a path-segment identifier of the current node that identifies anetwork path in the network path from the source node to the currentnode. A next portion 610 a 2 may be a path-segment identifier of a pathsegment to a next node from the current node. The next node follows thecurrent node in a sequence of nodes in a network path including thecurrent node and the destination node.

Alternatively or additionally, a routing component 404 a may identify,based on information in a next address field 610 a, a next-current pathsegment identifier, in the path-based protocol address, that identifiesthe current node with respect to a next node. A routing component 404 ainteroperating with an in-data handler component 402 may determine thecurrent-next path segment identifier, that identifies the next node,based on the next-current path segment identifier. In another aspect, arouting component may determine the next-current path segment identifierbased on the current-next path segment identifier.

With respect to FIG. 5A, an address representation 602 a may be includedin a data unit including data from a source node 502 a to transmit to adestination node 506 a. An address information field 606 a may include apath-based protocol address that identifies the sequence 1.2.2.3.2 that,in the data unit, identifies the destination node 506 a. Note that thesource node 502 a is illustrated in a first region 510 a 1 in thenetwork 500 a. A first scope-specific address space may be specific tothe first region 510 a 1. The sequence 1.2.2.3.2 may be represented inan address information field 606 a to identify a protocol address that,in the first scope-specific address space, identifies the destinationnode 506 a. Further, the sequence may be included in a path-basedprotocol address that identifies the destination node 506 a in a dataunit including data sent from the source node 502 a.

In an aspect of the method illustrated in FIG. 2, address information ina data unit may identify a source-destination path-based protocoladdress that identifies a destination node with respect to a sourcenode. Alternatively, or additionally the address information mayidentify a destination-source path-based protocol address that, withrespect to the destination node, identifies the source node. Acurrent-next path segment identifier may be included in at least one ofthe source-destination protocol address and the destination-sourceprotocol address. The current-next path segment identifier may includeone or more of a nested protocol address; a scope-specific protocoladdress that, in a current scope-specific address space specific to acurrent region including a current node, identifies a next node withrespect to the current node; and a path-based protocol address thatidentifies a network path from the current node to the next node.

At the source node 502 a, the address separator field 604 a may be setto include a size of zero for a previous address field 608 a. Theaddress information field 606 a, thus, includes a next address field 610a at the source node 502 a and identifies the destination node 506 awith respect to nodes in the first region 510 a 1 by identifying aspecific network path included in transmitting data from the source node502 a to the destination node 506 a.

At a first path node 504 a 1, outside the first region 510 a 1, anaddress separator field 604 a in a data unit including the data from thesource node 502 a, may include a value of 1 that identifies, in aprevious address field 608 a, a previous-current path segmentidentifier, in destination protocol address, identifies the first pathnode 504 a 1. A routing component 404 a in a first path node 504 a 1 maydetect the value. The routing component 404 a may also identify, basedon the value in the address separator field 604 a, a next address field610 a that identifies 2.2.3.2 as a current-next path segment identifierthat, in the destination protocol address, also identifies thedestination node 506 a. The routing component 404 a may detect thecurrent-next path segment identifier.

At the destination node 506 a a data unit including the data from thesource node 502 a may include a value in an address separator field 604a that indicates that the address information field includes only aprevious address field 608 a identifying the network path 1.2.2.3.2,which is included in the destination path-based protocol address.

In another aspect, the method illustrated in FIG. 2 may includedetecting, in a data unit by a current node, address-separatinginformation specified according to a network protocol to detect the nextaddress information and/or the previous address information. The addressseparating information may be updated in a next data unit foridentifying, by the next node, at least one of next-previous pathsegment identifier and next-next path segment identifier in the addressinformation, wherein the next-previous address information includes apath segment identifier that identifies the current node as a previousnode. In yet another aspect, address separating information may beupdated in a data unit received by a current node to identify, by thecurrent node, the previous address information and the next addressinformation in the address information. As the data from the source node502 a is transmitted from node to node in the network path the valuerepresented in an address separator field 604 a in an addressrepresentation 602 a in a data unit including the data or a portionthereof may be adjusted to identify a path segment identifier in apath-based protocol address to identify a next node for each nodeoperating as a current node in the network path.

The above description describes an address representation 602 aprocessed in the role of a destination path-based protocol address in adata unit of a network protocol, such as a version of the internetprotocol. An address information field 606 a may include source addressinformation sent in one or more data units included in sending data froma source node to a destination node. Returning to FIG. 5A, a data unitincluding data sent from the source node 502 a to the destination node506 a may include source address information including a representationof a source path-based protocol address in an address information field606 a. At the second path node 504 a 2, an address separator field mayidentify a previous address field 608 a identifying the sequence 0.0that identifies a path segment identifier that, in the source path-basedprotocol address, identifies the source node 502 a to the second pathnode 504 a 2. Note that the address 0.0 identifies the source node 502 anode to all nodes in the second region 510 a 2 that communicate with thesource node 502 a via data units of the network protocol and may be anaddress in a scope-specific address space specific to the second region510 a 2. The address information field 606 a including the sourceaddress information at the second path node 504 a 2 may include a nextaddress field 610 a, identified by the address separator field 604 a,identifying the sequence 0.1.0 that identifies a path segmentidentifier, in the source path-based protocol address, that identifiesthe second path node 504 a 2 to the destination node 506 a.

FIG. 6B illustrates a variant of the address type illustrated in FIG.6A. Instead of or in addition to including an address separator fieldthat distinguishes a previous address field from a next address fieldbased on a size, a bit-mask may be specified as one or more addressseparator fields 604 b to identify a previous address field 608 b and anext address field 610 b in an address information field 606 b in anaddress representation 602 b of a data unit formatted according to aparticular network protocol, such as IP or IPX. Address informationformatted as illustrated in FIG. 6B may be processed by a routingcomponent 404 a interoperating with an in-data handler component 402 ain an analogous manner to that described for the address information inFIG. 6A based on the bit mask address separator field(s) 604 b ratherthan and/or in addition to a size address separator field 604 aillustrated in FIG. 6A.

As described above and further described below, a path-based protocoladdress may include and/or may otherwise be based on path informationfor a network path included in communicatively coupling a pair of nodesin a network. Detecting a path-based protocol address and/or a protocoladdress in a path-based protocol address may include determining pathinformation identifying a network path included in communicativelycoupling a pair of path end nodes included in transmitting data from asource node to a destination node.

FIG. 6C illustrates an address representation 602 c identifying apath-based protocol address including path information that may bedetected by a routing component 404 a. An address information field 606c may include a path-based protocol address that may be interpreted asincluding a network path identifier based on address separator field(s)604 c in a data unit. Address separator fields are specified accordingto a network protocol to distinguish one path segment identifier fromanother path segment identifier in an address information field 606 c.Each path segment identifier and/or group of consecutive path segmentidentifiers may be a representation of a protocol address of the networkprotocol of a data unit including an address representation 606 c.

In an aspect, illustrated in FIG. 6C, a routing component 404 a and/oran in-data handler component 402 a may distinguish hop identifiers,since a single hop is a network path and/or a path segment. A routingcomponent 404 a may distinguish separate hop identifiers based onchanges in values in bits of consecutive address separator fields 604 c.In FIG. 6C, a first address separator field 604 c 1 includes one or more1-valued bits that correspond to bit positions in the addressinformation field 606 c to identify a previous address field referred toin FIG. 6C as a first hop information field. Network paths that includemore than one hop may be distinguished similarly as shown in FIG. 6B.Combinations of hop identifiers and path segment identifiers may bedistinguished by a routing component 404 a and/or an in-data handlercomponent 402 a based on information in address separator fields 604.The routing component 402 a may detect protocol addresses thatcorrespond to the various combinations of hop identifiers and/or pathsegment identifiers. A second hop information field 604 c 2, in FIG. 6C,includes two 0-valued bits to identify a second hop information field inaddress information field 606 c. Additional alternating sequences of1-valued bits and 0-valued bits illustrated by address separator fields604 c 3-12 c correspond to and identify other hop information fieldsidentifying hops in a network path communicatively coupling a sourcenode 502 and a destination node 506.

Path information may include hop information identifying a hop. Nextaddress information may be defined by a network protocol to include nextpath information identifying a current-next path identifier of a nextnetwork path included in communicatively coupling a current node anddestination node. Alternatively or additionally, previous addressinformation may be defined by the network protocol to include previouspath information identifying a previous-current path segment identifierof previous network path included in communicatively coupling thecurrent node and the source node. Next path information may include nexthop information identifying a hop in the next network path. Previouspath information may include previous hop information identifying a hopin the previous network path. A network protocol may define a hopidentifier to be a valid protocol address that identifies a protocolendpoint.

In FIG. 5C, a hop may be identified by an interface identifier that mayidentify directly and/or indirectly one or more network interfaces in apair of communicatively coupled nodes included in the hop. For example,the number 1 may serve as a hop identifier specific to a second pathnode 504 c 2 to identify a third hop 512 c 3 including the second pathnode 504 c 2 and a fourth path node 504 c 4. The number 1 may alsoidentify a network path for exchanging data between the two nodes. Thenumber 1 may also be a protocol address that, in a path-based protocoladdress identifying a destination node in a data unit including datafrom a source node, identifies the fourth path node 504 c 4 in a networkpath from the source node to the destination node. The number 1 may alsoidentify a hop for the fourth path node 504 c 4 to exchange data withthe second path node 504 c 2 and may also be a protocol address thatidentifies the second path node 504 c 2 and identifies a particularnetwork interface of the second path node 504 c 2 in a data unit sentfrom the fourth path node 504 c 4.

A source node 502 c may identify a destination node 506 c by adestination path-based protocol address. The protocol address may bebased on a sequence of hop identifiers 0.1.3.2.3.0.51. Note that othernetwork paths are illustrated for transmitting data from the source node502 c to the destination node 506 c and may also identify path-basedprotocol addresses that identify the destination node 506 c to thesource node 502 c.

A seventh path node 504 c 7 in the identified network path may identifythe destination node 506 c based on another sequence of hop identifiers3.0.51 that identifies a path segment. The sequence of hop identifiersmay identify a protocol address that, in the destination path-basedprotocol address, identifies the destination node 506 c. Note that arouting component 404 a operating in the seventh path node 504 c 7 maydetect the path segment identifier sequence 3.0.51, in and/or otherwisebased on the path-based protocol address of the destination node 506 c.Further, the routing component 404 a may detect a path segmentidentifier for the eighth path node 504 c 8 as well as a path segmentidentifier for the ninth path node 504 c 4, in and/or otherwise based onthe protocol address based on the path segment identifier 3.0.51.

The destination node 506 c is illustrated in a third region 510 c 3.Within the third region 510 c 3, the destination node 506 c may beidentified by a local scoped address 51, which identifies a pathsegment. Nodes in the third region 510 c 3 may identify nodes outsidethe third region 510 c 3 by path-based protocol addresses, and may uselocal scoped addresses to identify nodes in the third region 510 c 3.

The hop identifiers 0.1.3.2.3.0.51 may be represented in a path-basedprotocol address in an address representation 602 c in a data unitincluded in sending data from the source node 502 c to the destinationnode 506 c. At the seventh path node 504 c 7, a routing component 404 amay determine and/or otherwise detect a path segment identifieridentifying a network path to a next node based on a next address fieldidentifying the path segment identifier 3.0.51 in the path-basedprotocol address. The identifiers may be given a bit or binaryrepresentation and the hop identifiers may be distinguished or separatedvia address separator fields 604 c as described above with respect toFIG. 6C. An address separator field analogous to that shown in FIG. 6Amay also or alternatively be included and processed as described above.Assignment of hop identifiers is described in application Ser. No.13/727,649 filed on 2012 Dec. 27, entitled “Methods, Systems, andComputer Program Products for Assigning an Interface identifier to aNetwork Interface”, application Ser. No. 13/727,655 filed on 2012 Dec.27, entitled “Methods, Systems, and Computer Program Products forDetermining a Shared identifier for a Hop in a Network”.

Note that the address information that identifies one or more pathsegment identifiers for the seventh path node 504 c 7 and for thedestination node 506 c in the preceding description may includeinformation to identify a return path or a portion thereof. For example,the path-based protocol address 3.0.51 includes the path segmentidentifier 0.3, which may be included in a path-based protocol addressthat identifies the seventh path node nodes in the third region 510 c 3and may be path-based protocol address that identifies the seventh pathnode 504 c 7 to the ninth path node 504 c 9. The path-based protocoladdress 0.1.3.2 includes another path-based protocol address 2.3.1 thatidentifies a network path from the seventh path node 504 c 7 to a nodehaving a network interface in first region 510 c 1, illustrated by asecond path node 504 c 2.

Separate source address information may be included in a data unitreceived by the seventh path node 504 c 7 that includes data sent fromthe source node 502 c. Address information in the data unit may includea source path-based protocol address representation 602 c that mayidentify 2.3.1.101 as a protocol address that identifies the source node502 c. Note that 101 may identify a hop in the first region 510 c 1 fromthe second path node 504 c 2 to the source node 502 c, in some aspects.For example, subnet 514 c 1 may be a LAN. In another aspect, 101 may bea scoped address that identifies the source node 502 c in the scope ofthe first region 510 c 1. Thus, a path-based protocol address mayinclude a scoped address, which may identify a path segment.

FIG. 6D includes an address representation 602 d illustrating a schemafor representing a path-based protocol address including pathinformation based on identifiers of network interfaces included in a hopand/or in path end nodes in a network path. A routing component 404 aand/or an in-data handler component 402 a may operate based on theschema or a portion of the schema. An address information field 606 dincludes a path-based protocol address to identify a network path tocommunicatively couple a pair of path end nodes. FIG. 6D illustratesthat an address representation 602 d may include one or more addressseparator fields 604 d that correspond to and/or otherwise identifyrespective one or more portions of the address information field 606 dthat are based on one or more pairs of identifiers of network interfacesof path end nodes. An address separator field 604 d includes series of1-valued bits and 0-valued bits. A change from a 1-valued bit to a0-valued bit and vice versa may indicate, to a routing component 404 aand/or an in-data handler component 402 a, a boundary separatinginterface identifiers. Since a protocol address may consist of a singlehop, a pair of interface identifiers corresponding to an addressseparator portion 604 d may identify network interfaces in a hopidentified in a protocol address. An address separator field 604 d 1includes one 0-valued bit followed by four 1-valued bits. The 0-valuedbit may be defined to indicate that a first network interface in a firsthop identifier is 1 bit long with a corresponding position in theaddress information field 606 d. FIG. 6D identifies the first interfaceidentifier as the number 1 in base ten. The four 1-valued bits in thefirst address separator field 604 d 1 may be similarly defined toidentify the location of a second interface identifier in the first hopidentifier. The second interface identifier, as illustrated in FIG. 6D,has the value 10 in base ten. The first hop identifier includes thenumbers 1 and 10. A second hop identifier is located by the end of theseries of four 1-valued bits in the first address separator field 604 d1 to a series of three 0-valued bits that identify a boundary of asecond address separator field 604 d 2 for second hop informationidentifying a second hop identifier, and the three 0-valued bits alsoidentify the location of a first interface identifier in second hopinformation in the address information field 606 d. Two subsequent1-valued bits identify the location in the address field 606 d of asecond interface identifier in the second hop information. The secondhop identifier includes the numbers 6 and 0 in base ten. The remainingaddress separator fields 604 d may be processed similarly.

The path-based protocol address illustrated FIG. 6D may be representedtextually as 1-10.6-0.0-5.1-14.5-0.6. Note that the last hop mask doesnot identify a pair of identifiers and is similar to address portionsidentified based on address separator fields 604 c described withrespect to FIG. 6C or may be a local scoped address. This is illustratedto demonstrate that path-based protocol addresses may be uniform ornon-uniform in their format and content. FIG. 6D illustrates that hopidentifiers may be protocol addresses with respect to one or both nodesin the respective hops identified by the hop identifiers. A hopidentifier may serve as a protocol address to identify a next node inthe context of a path node, in a network path, identified the hop. A hopidentifier may serve as a protocol address to identify a previous nodefor a path node in the network path.

In FIG. 5B, a source node 502 b may identify a destination node 506 b bya destination path-based protocol address, where the path-based protocoladdress is based on pairs of interface identifiers that identify pathsegments as described in the previous paragraphs. For example, FIG. 5Billustrates a sequence of pairs of interface identifiers151-254.151-254.253-105 may be a path-based protocol address thatidentifies the destination node 506 b. The source node 502 b may send adata unit including an address representation 602 d illustrated in FIG.6D. Note that reversing the interface identifiers yields the identifier105-253.254-151.254-151 that may be a path-based protocol address thatidentifies the source node 502 b in a data unit exchanged by the sourcenode 502 b and the destination node 506 b

For the first path node 504 b 1, an address representation 602 d in adata unit including data received from the source node 502 b may includeprevious address information, identified by a routing component 404 abased on one or more address separator fields 604, that identifies thepath segment identifier 151-254 and/or that identifies the path segmentidentifier 254-151. The sequence ordered as 151-254 may be a pathsegment identifier, in a destination path-based protocol address, thatidentifies the first path node 504 b 1. The sequenced ordered as 254-151may be a path segment identifier, in source path-based protocol address,that identifies the source node.

Further for the first path node 504 b 1, the address representation 602d may include next address information identified by the routingcomponent 404 a based on one or more address separator fields 604 d thatidentify the sequence 151-254.253-105 in a first order and/or in asecond order. The sequence 151-254.253-105 in the first order mayidentify a path-based protocol address that identifies the destinationnode 506 b. The sequence 105-253.254-151 in the second order mayidentify a path-based protocol address that identifies the first pathnode 504 b 1.

Still further, for the first path node 504 b 1, the next addressinformation identified by the routing component 404 a identifies thesequence 151-254 in a first order and/or in a second order. The sequence151-254 in the first order may be a path segment identifier, in thedestination path-based protocol address, that identifies a second pathnode 504 c 2 in a network path to the destination node 506 b. Thesequence 254-151 in the second order may be a path segment identifier,in the source path-based protocol address, that identifies the firstpath node 504 b 1. A sequence of hop identifiers based on interfaceidentifiers may serve as a first path-based protocol address whenprocessed in one order of the sequence and may serve as a secondpath-based protocol address when processed according to another order ofthe sequence.

FIG. 6E illustrates an address representation 602 e that furtherdemonstrates that an address handler component 404 a may detect a pathsegment identifier that identifies a network path to a next node, in apath-based protocol address. An address representation 602 e may includeportions that include path information and/or portions that includescoped protocol addresses. A routing component 404 a may distinguishpath segment identifiers in portions of a path-based protocol addressbased on address separator fields 604 e. Address separator fields 604 emay be defined to identify path segment identifiers in the portions in amanner similar to the method described for distinguishing hopidentifiers in FIG. 6C. A previous address information field 606 e 1, inFIG. 6E, corresponding to a first address separator field 604 e 1includes a single interface identifier for an outbound network interfacefor the source node 502 c as described above with respect to FIG. 6A andFIG. 5C. A next address information field 606 e 2 corresponding to asecond address separator field 604 e 2 may include a scoped protocoladdress having an inside scope, an outside scope, or both. A nodeprocessing the second address information field 606 e 2 may be includedin a portion of a network spanned by the scope of the scoped protocoladdress. The node may process the scoped protocol address accordingly.See application Ser. No. 11/962,285, by the present inventor, filed on2007 Dec. 21, entitled “Methods and Systems for Sending Information to aZone Included in an Internet Network” for a description of addresseshaving outside scope and/or inside scope and processing of suchaddresses. A third address information field 606 e 3 corresponding to athird address separator field 604 e 3 may include a pair of identifiersas described with respect to FIG. 6D. A fourth address information field606 e 4 corresponding to a fourth address separator field 604 e 4 mayinclude a path segment identifier as described with respect to the nextaddress information field 606 e 2 such as a local scoped address.

In FIG. 5B, a source node 502 b may be included in a first region thatincludes network interfaces coupling nodes to a first network 514 b 1included in a network 500 b. A destination node 506 b may be included ina third region that includes network interfaces coupling nodes to athird network 514 b 3. Each of the two nodes may identify the other by apath-based protocol address. For example, a sequence of local scopedaddresses 254.254.105 may be a sequence of path segment identifiers in aprotocol address that may identify the destination node 506 b to thesource node 502 b as well as to other nodes in the first region definedby the first network 514 b 1. A data unit including an addressrepresentation 602 e in FIG. 6E may identify path segment identifiersbased on a sequence of scoped addresses.

For a second path node 504 b 2, an address representation 602 e in adata unit including data received from the source node 502 b may includeprevious address information identified by a routing component 404 a inthe second path node 504 b 2 based on one or more address separatorfields 604 e that identifies a previous path segment identifier 254.254in previous address information in the address representation 602 e. Theprevious path segment identifier may identify a protocol address thatidentifies the second path node 504 b 2. Further, for the second pathnode 504 b 2, the previous address information identified by a routingcomponent 404 a in the second path node 504 b 2 identifies a first pathsegment identifier 254 that identifies a network interface of the secondpath node 504 b 2 to nodes with network interfaces in the second network514 b 2. Yet further for the second path node 504 b 2, the addressrepresentation 602 e may include next address information identified bythe routing component 404 a in the second path node 504 b 2 based on oneor more address separator fields 604 e that identifies a scoped address105. The scoped address 105 in the scope of the third network 514 b 3identifies the destination node 506 b to nodes with network interfacesin the third network 514 b 3, such as the second path node 504 c 2.

Returning to FIG. 2, a block 206 illustrates that the method yet furtherincludes determining, based on the current-next path segment identifier,a current-next network interface that is included in the current-nextpath segment. Accordingly, a system for routing based on a path-basedprotocol address includes means for determining, based on thecurrent-next path segment identifier, a current-next network interfacethat is included in the current-next path segment. For example, thearrangement illustrated in FIG. 3, includes the forwarding component 306that is operable for and/or otherwise is included in determining, basedon the current-next path segment identifier, a current-next networkinterface that is included in the current-next path segment; and. FIGS.4A-C illustrate forwarding components 406 as adaptations and/or analogsof the forwarding component 306 in FIG. 3. One or more forwardingcomponents 406 operate in an execution environment 401.

In FIG. 4A, a routing component 404 a may provide a path segmentidentifier of a network path to a next node and/or forwardinginformation based on the path segment identifier to a forwardingcomponent 406 a to determine a network interface to send data from asource node 502 to a destination node 506 via a next node in a networkpath from a current node 504 including the forwarding component 406 a.In FIG. 4A, a forwarding component 406 a is illustrated operativelycoupled to a network layer component 403 a and operatively coupled tothe routing component 404 a.

In an aspect, determining a next network interface based on a pathsegment identifier of a next node may include detecting an interfaceidentifier in the path segment identifier. In FIG. 5C, data in a dataunit may be received by the seventh path node 504 c 7 from the sourcenode 502 c. Address information in the data unit may identify thedestination node 506 c via a protocol address 0.1.3.2.3.0.51representing a sequence of hops in a network path including the sourcenode 502 c and the destination node 506 c.

As described above, the routing component may determine that a pathsegment identifier based on the sequence 3.0.51 identifies a networkpath to the destination node 506 c. Further, the hop identifier 3 may bea path segment identifier identifying a network path to the eighth pathnode 504 c 8 as a next node. The number 3, as described above isassigned to identify a hop including the seventh path node 504 c 7 andthe eighth path node, and thus identifies a network interface, in theseventh path node 504 c 7, that is included in the hop.

Identifying a next network interface may include performing a mappingand/or lookup that maps a portion of a path segment identifieridentifying a network path to a next node to an identifier thatidentifies a NIC 405 a to a link layer component 407 a. A next networkinterface may be identified by mapping a path segment identifier to alink layer address by means of a lookup table or record associating thepath segment identifier with the link layer address.

A path-based protocol addresses illustrated in any of FIGS. 6A-E mayinclude a path segment identifier identifying network path to nextnodes. In some aspects, a path segment identifier of a network path to anext node includes an identifier of a network interface for transmittingdata to a destination protocol address via a network path that includesthe network path to the next node identified by the path segmentidentifier. Routing tables and/or routing policies are not required whenprotocol addresses include path segment identifiers.

Returning to FIG. 2, a block 208 illustrates that the method yet furtherincludes sending, via the current-next network interface, the data tothe next node. Accordingly, a system for routing based on a path-basedprotocol address includes means for sending, via the current-nextnetwork interface, the data to the next node. For example, thearrangement illustrated in FIG. 3, includes the out-data handlercomponent 308 that is operable for and/or otherwise is included insending, via the current-next network interface, the data to the nextnode. FIGS. 4A-C illustrate out-data handler components 407 a asadaptations and/or analogs of the out-data handler component 308 in FIG.3. One or more out-data handler components 407 a operate in an executionenvironment 401.

In FIG. 4A, a forwarding component 406 a may provide data to an out-datahandler component 408 a to send the data to a next node via anidentified network interface identified by forwarding component 406 a.The next node may be a destination node 506 or a path node 504 in anetwork path for transmitting data from a source node 502 to thedestination node 506. In FIG. 4A, an out-data handler 406 a isillustrated operating in a network layer component 403 a. The out-datahandler component 402 a may include the data in one or more networklayer protocol data units including a path-based protocol address, asdescribed above, identifying the destination node 506 according to anetwork layer protocol of the network protocol component 403 a.

The one or more network layer protocol data units may be provided to alink layer component 407 a as data to include in one or more link layerprotocol data units to transmit via a NIC 405 a based on the networkinterface identified by the forwarding component 406 a. In a node withone NIC operatively coupled to a physical data transmission medium orwith multiple NICs operatively coupled to the shared data transmissionmedium, an out-data handler component 408 a may send network layer datapackets via the one NIC or any of the multiple NICs over the physicaldata transmission medium for delivery to the destination node 506according to network interface identified by the forwarding component406 a. Link layer protocol data units may be sent by the link layercomponent 407 a according to a compatible link layer protocol and linklayer address information. For example, Ethernet frames may be sent aslink layer protocol data units via an Ethernet cable operatively coupledto a NIC 405 a 1 included in a suitable network path for transmittingthe data to the destination node 506.

FIG. 4B illustrates another exemplary execution environment 401 b thatmay include and/or otherwise be provided by a path node 504 in FIGS.5A-C. In FIG. 4B, the execution environment 401 b includes a first linecard 409 b 1 that includes a first NIC 405 b 1. The first NIC 405 b 1may operatively couple the path node 504 to a previous network path withrespect to data from a source node 502 to relay to a destination node506. The execution environment 401 b also includes a second line card409 b 2 including a second NIC 405 b 2 to operatively couple the pathnode 504 to a next network path with respect to the data from the sourcenode 502.

Data sent from a source node 502 to an identified destination node 506may be received in a data unit of a network protocol by the first NIC405 b 1 in the path node 504. The data may be detected by an in-datahandler component 402 b 1 operatively coupled to the first NIC 405 b 1.A path-based protocol address may be detected in an addressrepresentation included in the data unit according to the networkprotocol. The in-data handler component 402 b 1 may send the some or allof the path-based protocol address to a routing component 404 b via aninternal communications medium 421 b, such as a bus 116 in FIG. 1, todetermine a path segment identifier, in a path-based protocol address,that identifies a next node. The routing component 404 b may include, beprocessed by, and/or otherwise interoperate with a general processingunit 419 b and/or other hardware in processing the address information.A routing component 404 b may be included, in some aspects, to alsoprocess protocol addresses that do not include an identifier of the nextnetwork interface component or for routing IP addresses from globaladdress spaces as currently specified by RFC 791 and RFC 3513.

The routing component 404 b may determine the path segment identifier ofthe next node as describe above and/or in an analogous manner. Therouting component 404 b may provide some or all of the path segmentidentifier to a forwarding component 406 b. The forwarding component 406may identify a second line card 409 b 2 including a second NIC 405 b 2,based on some or all of the path segment identifier. The forwardingcomponent 406 b may interoperate with the GPU 419 b to configure theinternal data transmission medium 421 b to deliver the data received inthe data unit from the first line card 409 b 1 to the second line card409 b 2 for final packaging in one or more data units of the networkprotocol by an out-data handler component 408 b 2. The out-data handlercomponent 402 b 2 may interoperate with a second NIC 405 b to transmitthe data via a data transmission medium to which the second NIC 405 b 2is operatively coupled.

FIG. 4C illustrates still another exemplary execution environment 401 cthat may include and/or otherwise be provided by a path node 504illustrated in FIGS. 5A-C. In FIG. 4C, the execution environment 401 cincludes a first line card 409 c 1 that includes a first NIC 405 c 1.The first line card 405 c 1 may operatively couple the path node 504 toa previous network path with respect to data from a source node 502 torelay to a destination node 506. The execution environment 401 c alsoincludes a second line card 409 c 2 including a second NIC 405 c 2 tooperatively couple the path node 504 to a next network path with respectto the data from the source node 502.

In FIG. 4C, a routing component may be a distributed component. FIG. 4Cillustrates that a routing component may be realized as routing agentcomponents 404 c included in line cards 409 c in a path node 504. Aforwarding component may also be distributed as illustrated in FIG. 4Cby forwarding agent components 406 c included in the line cards 409 c.An FA component 406 c 1 may configure a switch interconnect unit (SIU)421 c to provide a communication channel from a first line card 409 c 1to a second line card 409 c 2 and vice versa, as needed. Each line card409 c may include a switch interface (SI) component 423 c to write datato a channel configured in the SIU component 421 c and/or to read datafrom a channel.

A routing agent (RA) component, such as a first RA component 404 c 1,may identify a path segment identifier based on address informationdetected by a first in-data handler (IDH) component 402 c 1. Based onsome or all of the path segment identifier, the first FA component 406 c1 may identify a next line card 409 c, such as the second line card 409c 2, to transmit data received from a source node 502 to a next nodeidentified by the path segment identifier as described above withrespect to FIG. 4A and FIG. 4B. The first FA 406 c 1 may setup a channelin the SIU component 421 c for communicating the data via a first SIcomponent 423 c 1 to a second SI component 423 c 2 of the second linecard 409 c 2. The second SI component 423 c 2 may read the datacommunicated via the SIU component 421 c and provide the data to asecond out-data handler (ODH) component 408 c 2 in the second line card409 c 2 to transmit to the next node. Data may be relayed from thedestination node 506 to the source node 502 via a second IDH component402 c 2 and a first ODH component 408 c 1 in an analogous manner.

The following aspects of the method illustrated in FIG. 2 have beendescribed above and illustrated in the drawings identified above.

Detecting the data may include receiving the data in a data unit sent bya previous node based on a previous-current path segment identifier, inthe plurality, that identifies the current node with respect to theprevious node.

The first path-base protocol address may identify a destination node forreceiving the data from a source node, via the current node and the nextnode, according to the network protocol. The first path-base protocoladdress may include the plurality in an identified first order thatidentifies the destination node, and the plurality in an identifiedsecond order may be included in a second path-based protocol address fortransmitting data from the destination node to the source node in one ormore data units of the network protocol. The first order and/or thesecond order may be identified by sequence information representedseparately from the plurality. The current node may be the source node.The next node may be the destination node.

The first path-base protocol address may be a scope-specific protocoladdress that, in a source scope-specific address space specific to afirst region of the network that includes the source node, identifiesthe destination node included in the network outside the first region.In still another aspect, the first path-base protocol address may be anested protocol address that includes a protocol address that identifiesa node in the network path other than the source node and thedestination node.

The current-next path segment identifier may include a local scopedaddress that identifies the next node in a region of the network thatincludes both the next network interface of the current node a networkinterface of the next node for receiving the data. In another aspect,the current-next path segment identifier may be included in a nestedprotocol address that includes a protocol address that identifies a nodein a network path for transmitting the data from the current node to thenext node. In an additional aspect, the current-next path segmentidentifier may be included in a scope-specific protocol address that, ina current scope-specific address space specific to a current region ofthe network that includes the current node, identifies the next nodethat is outside the current region.

In yet another aspect, the current-next path segment identifier mayinclude a next hop identifier that identifies a next pair of consecutivenodes in a network path from the current node to the next node fortransmitting the data to the next node. One or more of the current nodeand the next node may be included in the next hop. The next hopidentifier may identify the next hop to one or more of the current nodeand the next node. The next hop identifier may include one or more of anext interface identifier that identifies the network interface andnext-current interface identifier that identifies a next-current networkinterface in the next node for receiving the data. The next hopidentifier may be the smallest identifier available, according to a sizecriterion, in an identifier space for at least one of the current nodeand the next node.

To the accomplishment of the foregoing and related ends, thedescriptions and annexed drawings set forth certain illustrative aspectsand implementations of the disclosure. These are indicative of but a fewof the various ways in which one or more aspects of the disclosure maybe employed. The other aspects, advantages, and novel features of thedisclosure will become apparent from the detailed description includedherein when considered in conjunction with the annexed drawings.

It should be understood that the various components illustrated in thevarious block diagrams represent logical components that operate toperform the functionality described herein and may be implemented insoftware, hardware, or a combination of the two. Moreover, some or allof these logical components may be combined, some may be omittedaltogether, and additional components may be added while still achievingthe functionality described herein. Thus, the subject matter describedherein may be embodied in many different variations, and all suchvariations are contemplated to be within the scope of what is claimed.

To facilitate an understanding of the subject matter described above,many aspects are described in terms of sequences of actions that may beperformed by elements of a computer system. For example, it will berecognized that the various actions may be performed by specializedcircuits or circuitry (e.g., discrete logic gates interconnected toperform a specialized function), by program instructions being executedby one or more processors, or by a combination of both. The descriptionherein of any sequence of actions is not intended to imply that thespecific order described for performing that sequence must be followed.

Moreover, the methods described herein may be embodied in executableinstructions stored in a non-transitory computer readable medium for useby or in connection with an instruction execution machine, system,apparatus, or device, such as a computer-based or processor-containingmachine, system, apparatus, or device. As used here, a “non-transitorycomputer readable medium” may include one or more of any suitable mediafor storing the executable instructions of a computer program in one ormore forms including an electronic, magnetic, optical, andelectromagnetic form, such that the instruction execution machine,system, apparatus, or device may read (or fetch) the instructions fromthe non-transitory computer readable medium and execute the instructionsfor carrying out the described methods. A non-exhaustive list ofconventional exemplary non-transitory computer readable media includes aportable computer diskette; a random access memory (RAM); a read onlymemory (ROM); an erasable programmable read only memory (EPROM or Flashmemory); optical storage devices, including a portable compact disc(CD), a portable digital video disc (DVD), a high definition DVD(HD-DVD™), and a Blu-ray™ disc; and the like

Thus, the subject matter described herein may be embodied in manydifferent forms, and all such forms are contemplated to be within thescope of what is claimed. It will be understood that various details maybe changed without departing from the scope of the claimed subjectmatter. Furthermore, the foregoing description is for the purpose ofillustration only, and not for the purpose of limitation, as the scopeof protection sought is defined by the claims as set forth hereinaftertogether with any equivalents.

All methods described herein may be performed in any order unlessotherwise indicated herein explicitly or by context. The use of theterms “a” and “an” and “the” and similar referents in the context of theforegoing description and in the context of the following claims are tobe construed to include the singular and the plural, unless otherwiseindicated herein explicitly or clearly contradicted by context. Theforegoing description is not to be interpreted as indicating that anynon-claimed element is essential to the practice of the subject matteras claimed.

FIG. 8 illustrates an arrangement of components in a system thatoperates in an execution environment, such as execution environment 102in FIG. 1. The arrangement of components in the system operates toperform the method illustrated in FIG. 7. The system illustratedincludes a hop manager component 802, an address space directorcomponent 804, and a topology component 806. The execution environmentincludes a processor, such as the processor 104, to process aninstruction in at least one of the hop manager component 802, theaddress space director component 804, and the topology component 806.

With reference to FIG. 7, a block 702 illustrates that the methodincludes identifying a first hop identifier that is, for a first node ina network, an identifier of a first hop that includes a pair ofconsecutive nodes in a network path in the network. Accordingly, asystem for determining a protocol address for a node includes means foridentifying a first hop identifier that is, for a first node in anetwork, an identifier of a first hop that includes a pair ofconsecutive nodes in a network path in the network. For example, thearrangement illustrated in FIG. 8, includes a hop manager component 802operable for and/or otherwise included in identifying a first hopidentifier that is, for a first node in a network, an identifier of afirst hop that includes a pair of consecutive nodes in a network path inthe network.

In an aspect, hop information may be received in an exchange between afirst node in a hop and one or more of a second node in the hop and athird node in the network. A hop may be detected in response toexchanging and/or otherwise receiving the hop information.

Further, hop information for a network protocol may be detected bydetecting an active protocol end point, such as a TCP port, for thenetwork protocol and/or any network protocol included in activating theprotocol endpoint.

Hop information may be received in response to a user input detected byan input device. In an aspect, the hop information may be included intopology information that identifies a network topology or part of anetwork topology. In FIG. 5A, the third edge node 508 a 3 as describedabove may host a topology service that maintains network topologyinformation. Such a node may be referred to as a topology node. Some orall of the network topology information may be received via an inputdevice in response to a user input. A user may provide, via one or moreinput devices, hop information that identifies one or more of the firstpath node 504 a 1, the second path node 504 a 2, and a communicativerelationship that identifies the hop.

Hop information for a hop may be exchanged and/or received in responseto detecting a change in a state of an operable coupling between anetwork and a network interface included in the hop and included in anode in the hop. Detecting the change may include detecting that thestate indicates that the operable coupling is inoperative andsubsequently detecting that the state indicates the operable coupling isoperative. Detecting the change may include detecting that the stateindicates that the operable coupling is operative and subsequentlydetecting that the state indicates the operable coupling is inoperative.

Hop information may identify an interface identifier that identifies atleast one of a first network interface by which a first node is includedin a hop and a second network interface by which a second node isincluded in the hop.

Determining that a hop identifier meets an identified hop identifiercriterion may include determining that the hop identifier is thesmallest, available hop identifier in an identifier space of hopidentifiers.

Determining that a hop identifier meets an identified hop identifiercriterion may include identifying a threshold condition that is based onthe hop identifier criterion. The determining may further includedetecting that the threshold condition is met by the hop identifier. Thehop identifier may be determined in response to detecting that thethreshold condition is met. A threshold condition may be evaluated basedon a count of network interfaces included in one or more nodes in a hop,a size of a location in a data storage medium to store a hop identifier,a size of a representation of a hop identifier in a signal propagated bya specified data transmission medium, a size of a hop identifierincluded in a protocol address in a data unit that is valid according toa network protocol, and/or a time period to process a hop identifierincluded in a protocol address, to name a few examples.

A hop identifier criterion may specify and/or otherwise identify some orall of a schema that defines a valid format and/or a valid vocabularyfor a representation of a hop identifier when included in a protocoladdress identifying a protocol endpoint of a network protocol. In anaspect, the schema may specify and/or otherwise identify a format ruledefining a valid size of the representation in the protocol addressincluded in a data unit of the network protocol. A size specified by aschema may identify a maximum size for a representation of a hopidentifier. A size specified by a schema may identify a minimum size fora representation of a hop identifier. A size may identify an optimum orpreferred size, based on a specified criterion, for a representation ofa hop identifier. A size specified by a schema may identify a maximumsize for an interface identifier included in a hop identifier. A sizespecified by a schema may identify a minimum size for an interfaceidentifier included in a hop identifier. A size may identify an optimumor preferred size, based on a specified criterion, for an interfaceidentifier included in a hop identifier.

A hop identifier may be based on one of more network interfaces in nodesin the hop. More generally a hop identifier may be based on one or morenetwork interfaces in one more nodes for which a hop identifier servesto identify a particular hop. Thus, with respect to the method in FIG. 7the first hop identifier may be identified based on one or more of afirst network interface in the first node and a second network interfacein a node in the first hop, and/or a network interface in a node in anetwork path that from the first node to a node in the first hop.Further, with respect to the method in FIG. 7, the first hop identifiermay include a path identifier that identifies a network path included incommunicatively coupling the first node to a node in the first hop. Thefirst hop identifier of FIG. 7 may include a protocol address for thenetwork protocol that at least one of identifies the first node to anode in the hop and identifies a node in the hop to the first node.

Returning to FIG. 7, block 704 illustrates that the method furtherincludes receiving a first protocol address that for a network protocolat least one of identifies the first node to a second node in thenetwork and identifies the second node to the first node, wherein thesecond node is not in the first hop. Accordingly, a system fordetermining a protocol address for a node includes means for receiving afirst protocol address that for a network protocol at least one ofidentifies the first node to a second node in the network and identifiesthe second node to the first node, wherein the second node is not in thefirst hop. For example, the arrangement illustrated in FIG. 8, includesan address space director component 804 operable for and/or otherwiseincluded in receiving a first protocol address that for a networkprotocol at least one of identifies the first node to a second node inthe network and identifies the second node to the first node, whereinthe second node is not in the first hop.

Returning to FIG. 7, a block 706 illustrates that the method yet furtherincludes determining, based on the first protocol address and the firsthop identifier, a second protocol address that for the network protocolat least one of identifies, to the second node, a node in the first hopthat is not the first node and identifies the second node, to a node inthe first hop, that is not the first node. Accordingly, a system fordetermining a protocol address for a node includes means fordetermining, based on the first protocol address and the first hopidentifier, a second protocol address that for the network protocol atleast one of identifies, to the second node, a node in the first hopthat is not the first node and identifies the second node, to a node inthe first hop, that is not the first node. For example, the arrangementillustrated in FIG. 8, includes an topology component 806 operable forand/or otherwise included in determining, based on the first protocoladdress and the first hop identifier, a second protocol address that forthe network protocol at least one of identifies, to the second node, anode in the first hop that is not the first node and identifies thesecond node, to a node in the first hop, that is not the first node.

In a further aspect, a hop identifier may identify a hop to a node wherethe node is not in the hop.

As described above, one or more nodes in a network 500, as illustratedin FIGS. 5A-C, may individually or cooperatively operate to perform themethod of FIG. 7. An adaptation, analog, and/or instance of thearrangement of components in FIG. 8 may operate in a topology servicethat includes a topology node in a network. Hop information and protocoladdresses may be detected and/or reported to the topology node. Thetopology node may create, update, and/or otherwise maintain arepresentation of a topology of some or all of a network. The topologynode may be included in a group of topology nodes in a topology serviceor system. Each of the topology nodes may maintain a representation of atopology for a portion of the network and/or for the entire network. Asused herein, the term topology node is used interchangeably with theterm topology execution environment, which is an execution environmentthat hosts a topology service or a portion thereof. A topology executionenvironment may include and/or otherwise be hosted by one or more nodes.

In an aspect, a topology system may include topology nodes organized asa hierarchy of topology nodes that maintain a hierarchy of therepresentations of respective portions of a topology of a network. Inanother aspect, topology nodes may operate in a peer-to-peer system.

In yet another aspect of the method, in FIG. 7, the second protocoladdress may be associated with a symbolic identifier of one of the pathend nodes of the network path. The symbolic identifier may be resolvedto the second protocol address and vice versa.

With reference to FIG. 9, a block 902 illustrates that the methodincludes detecting, by a current node in a network, data in a data unitthat is specified according to a network protocol and that includes afirst protocol address including a plurality of other protocoladdresses. Accordingly, a system for routing based on a nested protocoladdress includes means for detecting, by a current node in a network,data in a data unit that is specified according to a network protocoland that includes a first protocol address including a plurality ofother protocol addresses. For example, the arrangement illustrated inFIG. 3, includes the in-data handler component 302 operable for and/orotherwise included in detecting, by a current node in a network, data ina data unit that is specified according to a network protocol and thatincludes a first protocol address including a plurality of otherprotocol addresses. FIGS. 4A-C illustrate in-data handler components 402as adaptations and/or analogs of the in-data handler component 302 inFIG. 3. One or more in-data handler components 402 operate in anexecution environment 401. In FIG. 4A, an in-data handler component 402a is included in network layer component 403 a. In FIG. 4B and in FIG.4C, in-data handler components 402 operates in respective line cardcomponents 409.

Returning to FIG. 9, a block 904 illustrates that the method furtherincludes detecting a current-next protocol address in the plurality thatidentifies a next node with respect to the current node. Accordingly, asystem for routing based on a nested protocol address includes means fordetecting a current-next protocol address in the plurality thatidentifies a next node with respect to the current node. For example,the arrangement illustrated in FIG. 3, includes the routing component304 operable for and/or otherwise included in detecting a current-nextprotocol address in the plurality that identifies a next node withrespect to the current node. FIGS. 4A-C illustrate routing components404 as adaptations and/or analogs of the routing component 304 in FIG.3. One or more routing components 404 operate in an executionenvironment 401.

Returning to FIG. 9, a block 906 illustrates that the method yet furtherincludes determining, based on the current-next protocol address, a nextnetwork interface. Accordingly, a system for routing based on a nestedprotocol address includes means for determining, based on thecurrent-next protocol address, a next network interface. For example,the arrangement illustrated in FIG. 3, includes the forwarding component306 operable for and/or otherwise included in determining, based on thecurrent-next protocol address, a next network interface. FIGS. 4A-Cillustrate forwarding components 406 as adaptations and/or analogs ofthe forwarding component 306 in FIG. 3. One or more forwardingcomponents 406 operate in an execution environment 401.

Nested protocol addresses illustrated in FIGS. 6A-E may include protocoladdresses that identify a next node. In some aspects, a protocol addressof next node includes an identifier of a network interface to transmitdata to a destination protocol address via a network path that includesa next node identified by the protocol address. Routing tables and/orrouting policies are not required when protocol addresses includeidentifiers of next nodes. In some aspects, routing tables and routingpolicies may be supported for some addresses included in destinationand/or source protocol address.

Returning to FIG. 9, a block 908 illustrates that the method yet furtherincludes sending, via the next network interface, the data to the nextnode. Accordingly, a system for routing based on a nested protocoladdress includes means for sending, via the next network interface, thedata to the next node. For example, the arrangement illustrated in FIG.3, includes the out-data handler component 308 operable for and/orotherwise included in sending, via the next network interface, the datato the next node. FIGS. 4A-C illustrate out-data handler components 408a as adaptations and/or analogs of the out-data handler component 308 inFIG. 3. One or more out-data handler components 408 a operate in anexecution environment 401.

With reference to FIG. 10, a block 1002 illustrates that the methodincludes receiving data, via a network from a previous node by a currentnode via a previous network interface operatively coupling the currentnode to the network, in a data unit that is specified according to anetwork protocol and that includes address information. Accordingly, asystem for routing based on a scope-specific address space includesmeans for receiving data, via a network from a previous node by acurrent node via a previous network interface operatively coupling thecurrent node to the network, in a data unit that is specified accordingto a network protocol and that includes address information. Forexample, the arrangement illustrated in FIG. 3, includes the in-datahandler component 302 operable for and/or otherwise included inreceiving data, via a network from a previous node by a current node viaa previous network interface operatively coupling the current node tothe network, in a data unit that is specified according to a networkprotocol and that includes address information. FIGS. 4A-C illustratein-data handler components 402 as adaptations and/or analogs of thein-data handler component 302 in FIG. 3. One or more in-data handlercomponents 402 operate in an execution environment 401. In FIG. 4A, anin-data handler component 402 a is included in network layer component403 a. In FIG. 4B and in FIG. 4C, in-data handler components 402operates in respective line card components 409.

Returning to FIG. 10, a block 1004 illustrates that the method furtherincludes detecting, based on the address information, a current-nextprotocol address that, in a current scope-specific address spacespecific to a current region including the current node, identifies anext node. Accordingly, a system for routing based on a scope-specificaddress space includes means for detecting, based on the addressinformation, a current-next protocol address that, in a currentscope-specific address space specific to a current region including thecurrent node, identifies a next node. For example, the arrangementillustrated in FIG. 3, includes the routing component 304 operable forand/or otherwise included in detecting, based on the addressinformation, a current-next protocol address that, in a currentscope-specific address space specific to a current region including thecurrent node, identifies a next node. FIGS. 4A-C illustrate routingcomponents 404 as adaptations and/or analogs of the routing component304 in FIG. 3. One or more routing components 404 operate in anexecution environment 401.

Address representations 602 in FIGS. 6A-E are described with respect totheir inclusion in data units of a network protocol. Each may beidentified as scope-specific, by a routing component 404 a, by a bitpattern or identifier defined to identify a protocol address type as ascope-specific address type. The bit pattern or identifier may belocated by the routing component 404 a stored in a type bits portion ofan IP packet and/or in some other specified location.

FIG. 6A illustrates an address representation 602 a that may be detectedby an in-data handler component 402 a and/or a routing component 404 ain a data unit or packet of an Internet Protocol or other network layerprotocol. An address representation 602 a may identify one or morescope-specific addresses for a respective one or more nodes in a networkpath to transmit data from a source node to a destination node via thenetwork path. A routing component 404 a, in a current node 504, mayprocess information in a previous protocol address field 608 a toidentify a previous protocol address that, in a previous protocoladdress space of a previous node in the network path, identifies thecurrent node 504. A routing component 404 a may identify, based oninformation in a next protocol address field 610 a, a next protocoladdress, that, in a current scope-specific address space of the currentnode, identifies a next node in the network path. In FIG. 6A previousportion 608 a 2 may be a scope-specific address of the current node in aregion that includes a previous node in a network path from the sourcenode to the current node. A next portion 610 a 2 may be scope-specificaddress of a next node to the current node, where the next node isoutside a region that includes the current node.

Alternatively or additionally, a routing component 404 a may identify,based on information in a next protocol address field 610 a, a currentprotocol address, that, in a next scope-specific address space specificto a next region that includes the next node, identifies the currentnode. A routing component 404 a interoperating with an in-data handlercomponent 402 may determine a next protocol address, in the currentscope-specific address space, that identifies the next node, based onthe current protocol address. Further, the next scope-specific addressspace may be a node-specific address space specific to the next node. Inanother aspect, a routing component may determine the current protocoladdress based on the next protocol address.

In still another aspect, a scope-specific address may conform to acurrently known schema defining a valid Internet Protocol address asspecified by RFC 791 and/or RFC 3513 in a scope-specific address spacesspecific to a region. The scope-specific address is processed asscope-specific as opposed to interpreting it as included in a globaladdress space as is currently done. In one aspect, a mapping may bespecified between two scope-specific address space. In another aspect, amapping may be specified from a scope-specific address space to a globaladdress space. A mapping may be ruled-based and/or may be specified byassociations such as represented by a lookup table.

A routing component 404 a in a current node 504 may detect first addressinformation identifying a current-first protocol address that, in acurrent scope-specific address space specific to a current region thatincludes the current node 504, identifies a first node in the network.Second address information identifying a first-second protocol addressthat, in a first scope-specific address space specific to a first regionthat includes the first node, identifies a second node in a network pathincluding the current node to transmit data from a source node 502 andan identified destination node 506. The routing component 404 aoperating in the current node 504 may detect a relationship between thecurrent-first protocol address and the first-second protocol address.The routing component 404 a may generate a first-to-current mapping rulebased on the relationship. The routing component 404 a may process thefirst-second protocol address based on the first-to-current mapping ruleto determine a current-second protocol address that, in the currentscope-specific address space, identifies the second node in the networkpath. The second node may be a next node with respect to the currentnode 504 and the data from the source node 502. The second node may bethe destination node 506.

A current-first protocol address 10.22.106.3 from a currentscope-specific address space, may serve as an identifier with respect tothe current node of a first node in the network. A first-second protocoladdress 40.88.58.1 in a first scope-specific address space, may serve asan identifier with respect to the first node of a second node. Thecurrent-first protocol address and first-second protocol address, in theexample, include four parts. A first-first protocol address may berepresented as 0.0.0.0 that, in the first scope-specific address spacesidentifies the first node. A routing component 404 in the current node504 may determine that the current-second protocol address, in thecurrent scope-specific address space, for the second node may becalculated based on the mapping rule represented here as 40+10 mod256.88+22 mod 256.106+58/mod 256.3+1 mod/256, or 50.110.164.4.

The mapping rule may be specific to the current scope-specific addressspace and the second scope-specific address space, may be specific to anidentified group of scope-specific address spaces specific to arespective group of regions, and/or may apply among all scope-specificaddress spaces in use by nodes in a network. Those skilled in the artwill see given the examples than many mapping rules exist that allowprotocol addresses to be determined from previous protocol addressinformation and next protocol address information according to themethod illustrated in FIG. 10.

A next protocol address and/or a previous protocol address may bedetermined and/or otherwise identified based on one or more of a schemaof one or more of a destination protocol address and/or a sourceprotocol address identified in an address information portion of a dataunit, a schema of a scope-specific hop identifier, a mapping between twoor more of the schemas or portions thereof of two or more respectivescope-specific address spaces, relationships between the nodes to whichthe protocol addresses are specific, relationships between thescope-specific address spaces of the protocol addresses, andrelationships between the nodes in a network that includes them. Some ofthe relationships listed may be represented in a network topology of thenetwork. A routing component 404 may detect some or all of the networktopology in determining a next protocol address and/or a previousprotocol address.

Returning to FIG. 10, a block 1006 illustrates that the method yetfurther includes determining, based on the current-next protocoladdress, a next network interface operatively coupling the current nodeto the network. Accordingly, a system for routing based on ascope-specific address space includes means for determining, based onthe current-next protocol address, a next network interface operativelycoupling the current node to the network. For example, the arrangementillustrated in FIG. 3, includes the forwarding component 306 operablefor and/or otherwise included in determining, based on the current-nextprotocol address, a next network interface operatively coupling thecurrent node to the network. FIGS. 4A-C illustrate forwarding components406 as adaptations and/or analogs of the forwarding component 306 inFIG. 3. One or more forwarding components 406 operate in an executionenvironment 401.

For scope-specific protocol addresses that do not include an identifierof a next node, a similar lookup operation may be performed. In anaspect, a scope-specific address may be mapped to another address spacesuch as global protocol address space or subnet-specific protocoladdress space shared by nodes in a portion of a network such as a LANand/or a sub-network. Performing a mapping operation may reduce thenumber of lookup tables and/or records that must be maintained and/orotherwise accessed.

Protocol addresses illustrated in FIGS. 6A-E may include identifiersfrom scope-specific address spaces that identify a next node. In someaspects, a protocol address of next node includes an identifier of anetwork interface to transmit data to a destination protocol address viaa network path that includes a next node identified by the protocoladdress. Routing tables and/or routing policies are not required whenprotocol addresses include identifiers of next nodes. In some aspects,routing tables and routing policies may be supported to supportaddresses from a global protocol address space and may be supported whena hop identifier identifies a pair of nodes in a network path that arecommunicatively coupled via one or more other path nodes.

Returning to FIG. 10, a block 1008 illustrates that the method yetfurther includes sending, via the next network interface, the data tothe next node. Accordingly, a system for routing based on ascope-specific address space includes means for sending, via the nextnetwork interface, the data to the next node. For example, thearrangement illustrated in FIG. 3, includes the out-data handlercomponent 308 operable for and/or otherwise included in sending, via thenext network interface, the data to the next node. FIGS. 4A-C illustrateout-data handler components 407 a as adaptations and/or analogs of theout-data handler component 308 in FIG. 3. One or more out-data handlercomponents 407 a operate in an execution environment 401.

The following aspects of the method illustrated in FIG. 10 have beendescribed above and illustrated in the drawings identified above. Theaddress information referred to FIG. 10 may include next protocoladdress information for identifying one or more of the current-nextprotocol address and a next-current protocol address that, in a nextscope-specific address space specific to a next region including thenext node, identifies the current node. Further, the address informationmay include previous protocol address information for identifying atleast one of a previous-current protocol address that, in a previousscope-specific address space specific to a previous region that includesthe previous node, identifies the current node and a current-previousprotocol address that, in the current scope-specific address space,identifies the previous node.

A first hop including a first hop node and a second hop node, both inthe network path, may be identified with respect to the previous node bya previous hop identifier in a previous scope-specific address spacespecific to a previous region that includes the previous node,identified with respect to the current node by a current hop identifierin the current scope-specific address space, and identified with respectto the next node by a next hop identifier in a next scope-specificaddress space specific to a next region that includes the next node.

The first hop identifier may be assigned from a first scope-specificaddress space specific to a first region that includes a networkinterface in the first hop node to identify the first hop in response toa negotiation between the nodes in the first hop.

A current-first path hop identifier that, in the current scope-specificaddress space, identifies the first hop and the current-first pathidentifier includes the first hop identifier, wherein the current-firstpath identifier identifies a network path that includes the current nodeas a path end node, the first hop node, and the second hop node. Thefirst hop may be included in communicatively coupling the current nodeand one of the source node and the destination node. The current nodemay be either the first hop node or the second hop node. Theprevious-current protocol address may include the first hop identifieror the current-next protocol address may include the first hopidentifier.

FIG. 12 illustrates an arrangement of components in a system thatoperates in an execution environment, such as execution environment 102in FIG. 1. The arrangement of components in the system operates toperform the method illustrated in FIG. 11. The system illustratedincludes an address handler component 1202, an address space directorcomponent 1204, and a resolver component 1206. A suitable executionenvironment includes a processor, such as processor 104, to process aninstruction in at least one of the address handler component 1202, theaddress space director component 1204, and the resolver component 1206.

With reference to FIG. 11, block 1102 illustrates that the methodincludes detecting first address information that identifies at leastone of a first-second protocol address that, according to a networkprotocol, identifies a second node to a first node in the network and asecond-first protocol address that, according to the network protocol,identifies the first node to the second node. Accordingly, a system foridentifying a protocol address in a scope-specific address spaceincludes means for detecting first address information that identifiesat least one of a first-second protocol address that, according to anetwork protocol, identifies a second node to a first node in thenetwork and a second-first protocol address that, according to thenetwork protocol, identifies the first node to the second node. Forexample, the arrangement illustrated in FIG. 12, includes an addresshandler component 1202 that is operable for and/or otherwise is includedin detecting first address information that identifies at least one of afirst-second protocol address that, according to a network protocol,identifies a second node to a first node in the network and asecond-first protocol address that, according to the network protocol,identifies the first node to the second node.

As described herein, a first node may detect address information thatidentifies a first-second protocol address that, in a firstscope-specific address space specific to a first region that includesthe first node, identifies the second node. Alternatively oradditionally, the second node may detect address information thatidentifies a second-first protocol address that, in a secondscope-specific address space specific to a second region that includesthe second node, identifies the first node to the second node.Alternatively or additionally, the second node may receive addressinformation identifying the first-second protocol address. The secondnode may determine the second-first protocol address based on thefirst-second protocol address. Alternatively or additionally, the firstnode may receive the second-first protocol address. The first node maydetermine the first-second protocol address based on the second-firstprotocol address.

Returning to FIG. 11, block 1104 illustrates that the method furtherincludes detecting second address information that identifies at leastone of a second-third protocol address that identifies, according to thenetwork protocol, a third node in the network to the second node and athird-second protocol address that identifies, according to the networkprotocol, the second node to the third node. Accordingly, a system foridentifying a protocol address in a scope-specific address spaceincludes means for detecting second address information that identifiesat least one of a second-third protocol address that identifies,according to the network protocol, a third node in the network to thesecond node and a third-second protocol address that identifies,according to the network protocol, the second node to the third node.For example, arrangement illustrated in FIG. 12, includes address spacedirector component 1204 that is operable for and/or otherwise isincluded in detecting second address information that identifies atleast one of a second-third protocol address that identifies, accordingto the network protocol, a third node in the network to the second nodeand a third-second protocol address that identifies, according to thenetwork protocol, the second node to the third node.

Returning to FIG. 11, block 1106 illustrates that the method yet furtherincludes determining, based on the first address information and thesecond address information, a first-third protocol address that, in afirst scope-specific address space specific to a first region thatincludes the first node, identifies the third node according to thenetwork protocol, wherein the third node is outside the first region.Accordingly, a system for identifying a protocol address in ascope-specific address space includes means for determining, based onthe first address information and the second address information, afirst-third protocol address that, in a first scope-specific addressspace specific to a first region that includes the first node,identifies the third node according to the network protocol, wherein thethird node is outside the first region. For example, the arrangement inFIG. 12, includes resolver component 1206 that is operable for and/orotherwise is included in determining, based on the first addressinformation and the second address information, a first-third protocoladdress that, in a first scope-specific address space specific to afirst region that includes the first node, identifies the third nodeaccording to the network protocol, wherein the third node is outside thefirst region.

As described various types of protocol addresses may conform to variousschemas defining rules for formatting valid protocol addresses and/ordefining vocabularies specifying valid content of a protocol address.Given first address information identifying a first protocol address andsecond address information identifying a second protocol address asdescribed above with respect to the method illustrated in FIG. 11, aresolver component may determine a scope-specific first-third protocoladdress based on one or more of a schema of one or more of the firstprotocol address, a schema of the second protocol address, a schema ofthe third protocol address, a mapping between two or more of the schemasor portions thereof, relationships between the nodes to which theprotocol addresses are specific, relationships between thescope-specific address spaces of the protocol addresses, and/orrelationships between the nodes in a network that includes them. Some ofthe relationships listed may be represented in a network topology of thenetwork. A resolver component may detect some or all of the networktopology in determining the first-third protocol address.

A mapping rule may indicate that addresses in a first scope-specificaddress space have a one-to-one mapping between the first scope-specificaddress space and a second scope-specific address space that is based onan addend for each of the four portions of the various addresses,additionally taking the modulus of the result based on a maximum valuefor each address information field, and determining the absolute valueto determine the final result. A third protocol address from the secondscope-specific address space may serve to identify a third node in athird region. The second protocol address may be represented as,200.10.150.33. A resolver component in the first node may determine thata third protocol address that, in the first scope-specific addressspace, identifies the third node may be calculated based on the mappingrule as “(200+30)mod 256·(10+66)mod 256·(150+198)mod 256·(33+254)mod256”, or 230.76.92.31.

Nodes may exchange mapping information. In an aspect, the addressinformation may identify a mapping rule when exchanged between nodes.The mapping rule may be determined by second node and sent to a firstnode. The mapping rule may include mapping information for mappingaddresses from the third scope-specific address space to the firstscope-specific address space.

As described above and illustrated in the accompanying drawings, themethod illustrated in FIG. 11 may include additional aspects supportedby various adaptations and/or analogs of the arrangement of componentsin FIG. 12. With respect to FIG. 11, in one aspect one or more of thefirst-third protocol address and the third-first protocol address mayidentify a third network path for exchanging data between the first nodeand the third node.

In another aspect, detecting the first address information may includedetecting first path information identifying a first network path. Thefirst network path includes a first sequence of nodes included intransmitting data between the first node and the second node.Analogously, detecting the second address information may includedetecting second path information identifying a second network path. Thesecond network path includes a second sequence of nodes included inexchanging data between the second node and the third node. One or moreof the first-third protocol address and the third-first protocol addressmay be determined based on the first path information and the secondpath information. The first-third protocol address and/or thethird-first protocol address may identify a third network path includinga third sequence of nodes included in communicatively coupling the firstnode and the third node.

In another aspect of the method illustrated in FIG. 11, the first-secondprotocol address may be in the first scope-specific address space, thesecond-first protocol address may be in a second-scope-specific addressspace specific to a second region that includes the second node, thesecond-third protocol address may be in the second scope-specificaddress space, and/or the third-second protocol address may be in thethird scope-specific address space. One or more of the scope-specificaddress spaces may be node-specific address spaces specific to therespective one or more of the first node, the second node, and the thirdnode.

Hop information may be exchanged between a first node in a hop and oneor more of a second node in the hop and a third node in the network. Ahop may be detected in response to exchanging the hop information. Inanother aspect, hop information may be exchanged in response todetecting a hop.

Hop information may be received in response to a user input detected byan input device. In an aspect, the hop information may be included intopology information that identifies a network topology or part of anetwork topology.

A hop including pair of nodes may include a first network interface in afirst node in the pair and a second network interface in a second nodein the pair.

In another, aspect, a first node may be included in a first hop thatincludes a second node via a first network interface and the first nodemay be included in a second hop that includes the second node via asecond network interface. The two NICs may be associated with differentinternet protocol addresses. Data units including one of the IPaddresses are processed by one of the NICs and data units including theother IP address are processed by the other NIC.

A first node may be included in a first hop along with a second node.The first node may be included in the first hop via a first networkinterface in the first node. The first node may be included in a secondhop including a third node. The first node may be included in the secondhop via a second network interface in the first node.

A first node and a second node may be included in a first hop in a firstnetwork path from a source node to a destination node. The first nodemay be included in the first hop via a first network interface in thefirst node included in communicatively coupling the first node and thesecond node. The first node and the second node may be included in asecond hop in a second network path from the source node to thedestination node. The first node may be included in the second hop via asecond network interface in the first node included in communicativelycoupling the first node and the second node.

Hop information for a hop may be exchanged in response to detecting achange in a state of an operable coupling between a network and anetwork interface included in the hop and included in a node in the hop.Detecting the change may include detecting that the state indicates thatthe operable coupling is inoperative and subsequently detecting that thestate indicates the operable coupling is operative. Detecting the changemay include detecting that the state indicates that the operablecoupling is operative and subsequently detecting that the stateindicates the operable coupling is inoperative.

A network protocol may be specified to exchange data between and/oramong nodes that include hop agent components to determine whethercertain network interfaces in the nodes are operative or inoperative.The protocol may include and/or be an extension of one more existingprotocols such as the address resolution protocol (ARP), the dynamichost configuration protocol (DHCP), and/or any of numerous networkprotocols for announcing and/or detecting the presence of a node, anetwork interface, and/or other resource on a network. The protocol maybe a yet unspecified protocol to count network interfaces in a region ofa network.

An interface identifier included in hop information for a hop includinga pair of nodes may be specified according to the requirements of anetwork protocol. The network protocol may be a network layer protocol,such the IPv4 and/or IPv6 protocols. The interface identifier mayidentify at least one node in a hop to the other. The interfaceidentifier may be suitable to include in a data unit of a networkprotocol to transmit data in the data unit between the nodes in the hop.Hop information for a hop may be exchanged in more than onecommunication sent and/or received by a node in the hop.

Determining a hop identifier for a hop may include determining the hopidentifier based on an interface identifier that identifies at least onenetwork interface in the hop. The interface identifier may identify atleast one of a first network interface in a first node in the hop and asecond network interface in a second node in the hop to at least one ofthe first node and the second node.

A hop identifier for a hop may be based on a first interface identifierthat identifies a first network interface in a first node in the hopand/or may be based on a second interface identifier that identifies asecond network interface in a second node in the hop. The firstinterface identifier may identify the first network interface to one orboth of the nodes in the hop. The second interface identifier mayidentify the second network interface to at least one of the first nodeand the second node. The hop identifier may include the first interfaceidentifier and/or the second interface identifier.

FIG. 14 illustrates an arrangement of components in a system, thatoperates in an execution environment, such as execution environment 102in FIG. 1. The arrangement of components in the system operates toperform the method illustrated in FIG. 13. The system illustratedincludes a path detector component 1402, an address space directorcomponent 1404, and a path composer component 1406. A suitable executionenvironment includes a processor, such as processor 104, to process aninstruction in at least one of the path detector component 1402, theaddress space director component 1404, and the path composer component1406.

Some or all of the exemplary components illustrated in FIG. 14, theiradaptations, and/or their analogs may operate in a number of executionenvironments to perform the method illustrated in FIG. 13.

With reference to FIG. 13, block 1302 illustrates that the methodincludes detecting first path information that identifies a firstsequence of nodes in a first network path for transmitting data betweena first node and a second node in a network. Accordingly, a system foridentifying a protocol address based on path information includes meansfor detecting first path information that identifies a first sequence ofnodes in a first network path for transmitting data between a first nodeand a second node in a network. For example, in the arrangement in FIG.14, detecting first path information that identifies a first sequence ofnodes in a first network path for transmitting data between a first nodeand a second node in a network is performed via operation of the pathdetector component 1402.

Returning to FIG. 13, block 1304 illustrates that the method furtherincludes detecting second path information that identifies a secondsequence of nodes in a second network path for transmitting data betweenthe second node and a third node in the network. Accordingly, a systemfor identifying a protocol address based on path information includesmeans for detecting second path information that identifies a secondsequence of nodes in a second network path for transmitting data betweenthe second node and a third node in the network. For example, asillustrated in FIG. 14, detecting second path information thatidentifies a second sequence of nodes in a second network path fortransmitting data between the second node and a third node in thenetwork is performed via operation of the address space directorcomponent 1404.

As described above and further below, path information for a networkprotocol may be detected in a data unit of the network protocol. Thepath information may be detected by a node transmitting the data unitand/or may be detected by a node receiving the data unit.

In another aspect, a message may be sent to a network directory serviceto register a name or symbolic identifier for a node and/or a networkinterface of a node. The network directory service may associate thesymbolic identifier with address information, which as described hereinmay be path information. Path information may be detected in theregistration message and/or in one or more data units of a networkprotocol for which an association is to be created and/or otherwisemaintained by a network directory service. Further, a response to theregistration message may be exchanged between the registering node andthe network directory service node. The response message and/or one ormore data units included in transmitting the response may include and/orotherwise identify path information that may be detected by either node.Nodes in a network path transmitting the response and/or theregistration request may detect path information in one or more dataunits received and/or sent in relaying some or all of one or bothmessages. Still further, a node may send a symbolic identifier to anetwork directory service in a resolve message in order to resolve thesymbolic identifier to a protocol address of a node and/or a networkinterface identified by the symbolic identifier. Path information may bedetected in the resolve message and/or in one or more data units of aprotocol that the symbolic identifier is associated with in anassociation maintained by a network directory service. Further, aresponse to the resolve message may be exchanged between the requestingnode and the network directory service node. The response message and/orone or more data units included in transmitting the response may includeand/or otherwise identify path information that may be detected byeither node. Nodes in a network path transmitting the response and/orthe registration request may detect path information in one or more dataunits that they receive and/or send in relaying some or all of one orboth messages.

Returning to FIG. 13, block 1306 illustrates that the method yet furtherincludes determining, based on the first path information and the secondpath information, a first-third protocol address that identifies,according to a network protocol, the third node to the first node fortransmitting data from the first node to the third node. Accordingly, asystem for identifying a protocol address based on path informationincludes means for determining, based on the first path information andthe second path information, a first-third protocol address thatidentifies, according to a network protocol, the third node to the firstnode for transmitting data from the first node to the third node. Forexample, as illustrated in FIG. 14, determining, based on the first pathinformation and the second path information, a first-third protocoladdress that identifies, according to a network protocol, the third nodeto the first node for transmitting data from the first node to the thirdnode is performed via operation of path composer component 1406.

With respect to the method in FIG. 13 and as described above, afirst-second protocol address that identifies the second node withrespect to the first node may be determined and/or otherwise identifiedbased on the first path information. Alternatively or additionally, asecond-first protocol address that identifies the first node withrespect to the second node may be determined and/or otherwise identifiedbased on the first path information. Further, a second-third protocoladdress that identifies the third node with respect to the second nodemay be determined and/or otherwise identified based on the second pathinformation. Alternatively or additionally, a third-second protocoladdress that identifies the second node with respect to the third nodemay be determined and/or otherwise identified based on the second pathinformation. The first-third protocol address may be determined based onat least one of the first-second protocol address and the second-firstprotocol and based on at least one of the second-third protocol addressand the third-second protocol address.

In an aspect of the method illustrated in FIG. 13, the first-thirdprotocol address may be in a first scope-specific identifier spacespecific to a first network region that includes the first node. Referto application Ser. No. 13/727,653 filed on 2012 Dec. 27, entitled“Methods, Systems, and Computer Program Products for Identifying aProtocol address in a Scope-specific Address Space”.

FIG. 16 illustrates an arrangement of components in a system thatoperates in an execution environment, such as execution environment 102in FIG. 1. The arrangement of components in the system operates toperform the method illustrated in FIG. 15. The system illustratedincludes a count component 1602, an address space condition component1604, an address space director component 1606, and an allocatecomponent 1608. A suitable execution environment includes a processor,such as the processor 104, to process an instruction in at least one ofthe count component 1602, the address space condition component 1604,the address space director (ASD) component 1606, and the allocatecomponent 1608.

Some or all of the exemplary components illustrated in FIG. 16 may beadapted to perform the method illustrated in FIG. 15 in a number ofexecution environments.

As the term “network topology” is defined herein, a network may havedifferent network topologies with respect to different layers and/ornetwork protocols and their corresponding protocol endpoints. A networktopology may represent physical communicative couplings between nodes inthe network. A network topology may represent logical hops in a network.In FIG. 5B, the first network 514 b 1 may represent a physical topologywhen the first network 514 b 1 represents a physical data transmissionmedium included in physically coupling nodes. The data transmissionmedium may be an Ethernet LAN, for example. The hops 512 in FIG. 5 mayillustrate logical communicative couplings at a level of the networkabove the data transmission medium. The hops 512 may represent linklayer hops, network layer hops, or hops at some other layer of thenetwork above the data transmission medium or physical layer.

With reference to FIG. 15, a block 1502 illustrates that the methodincludes detecting a count of network interfaces in a first region, of anetwork, that includes a first network interface operatively coupling afirst node to the first region. Accordingly, a system for assigning aninterface identifier to a network interface includes means for detectinga count of network interfaces in a first region, of a network, thatincludes a first network interface operatively coupling a first node tothe first region. For example, the arrangement illustrated in FIG. 16,includes count component 1602 operable for and/or otherwise included indetecting a count of network interfaces in a first region, of a network,that includes a first network interface operatively coupling a firstnode to the first region.

A region may include a single node with one or more network interfacesin the region and with no other network interfaces of other nodes in theregion. All of the one or more network interfaces in the node may be inthe region. Such a region is illustrated by a first region 510 a 1including a source node 502 a in FIG. 5A. The first region 510 a 1illustrates a region that includes a single node, the source node 502 a.

A node may include a network interface included in a region and mayinclude another network interface not in the region. In FIG. 5A, asecond path node 504 a 2 is illustrated having a network interfaceincluded in a second region 510 a 2 and another network interfaceincluded in a third region 510 a 3. A node may have a single networkinterface in a region and/or multiple network interfaces in a region.

A count or a partial count of network interfaces in a node in aparticular region may be detected by a node in the region or by a nodein another region. Detecting a count may include receiving countinformation identifying the count or a portion of the count, in responseto a user input detected by an input device via a node. In an aspect, acount of network interfaces and/or of NICs in one or more networkinterfaces in the source node 502 a may be a configuration setting setin response to an input detected from a user via an input device, suchas described with respect to FIG. 1.

Detecting a count may include detecting whether network interfacecomponents in a region are in the same node. Detecting the count mayfurther include determining that the network interface components arecoupled to a same data transmission medium. Whether network interfacecomponents in the same node are coupled to a same data transmissionmedium may affect how network interfaces are counted. The networkinterface components in the network interface may be assigned the sameprotocol address for a particular protocol, such a network layerprotocol. The internet protocol in the TCP/IP suite is an exemplarynetwork layer protocol. Network interface components assigned the sameprotocol address may be counted as a single network interface when acount is for a network protocol of the protocol addresses.

In another aspect, multiple network interface components in a node maybe operatively coupled to a same data transmission medium and may beincluded in more than one network interface for counting. Thus a nodethat includes multiple network interface components coupled to a samedata transmission medium, may have a network interface component in themultiple network interface components in one network interface andanother network interface component in the multiple network interfacecomponents may be included in another network interface.

As described above, detecting a change in a state of an operablecoupling may include detecting that the state indicates the coupling isinoperative, and subsequently detecting that the state indicates thecoupling is operative. Further, detecting a change in a state of acoupling may include detecting that the state indicates the coupling isoperative and subsequently detecting that the state indicates thecoupling is inoperative.

A count component may monitor one or more operations included in sendingdata and/or receiving data via an operable coupling including a networkand a network interface. Detecting a change in an operable coupling mayinclude performing an operation to send a data unit and/or to receive adata unit via the coupling, then determining whether the operation wassuccessful.

A count may be based on whether a network interface in a region is in anode that is configured to send and/or receive a data unit of aparticular network protocol via the network interface. A count ofnetwork interfaces may be performed according to the method illustratedin FIG. 15 for the purpose of assigning an identifier to a networkinterface for a particular network protocol.

Returning to FIG. 15, a block 1504 illustrates that the method furtherincludes determining, based on the count, a threshold condition.Accordingly, a system for assigning an interface identifier to a networkinterface includes means for determining, based on the count, athreshold condition. For example, the arrangement illustrated in FIG.16, includes address space condition component 1604 operable for and/orotherwise included in determining, based on the count, a thresholdcondition.

Returning to FIG. 15, a block 1506 illustrates that the method yetfurther includes identifying a first interface identifier that meets,based on a size attribute of the first interface identifier, thethreshold condition. Accordingly, a system for assigning an interfaceidentifier to a network interface includes means for identifying a firstinterface identifier that meets, based on a size attribute of the firstinterface identifier, the threshold condition. For example, thearrangement illustrated in FIG. 16, includes address space directorcomponent 1606 operable for and/or otherwise included in identifying afirst interface identifier that meets, based on a size attribute of thefirst interface identifier, the threshold condition.

Identifying a network interface may include identifying a schema or partof a schema defining a valid format and/or a valid vocabulary for arepresentation of an interface identifier. Interface identifiers areassigned to network interfaces for a purpose. Interface identifiers maybe assigned to network interfaces for routing data, received via anetwork interface in a node, to another network interface component inthe node to relay some or all of data received to another node.Interface identifiers may be included in a protocol address and/or maybe included in generating a protocol address for a network protocol asdescribed below. An interface identifier may be included in identifyinga network path in a network and/or a hop including a pair ofcommunicatively coupled nodes. As described above interface identifiersmay be selected for saving power when processed in performing specifictasks, selected to save storage space, selected to save processing time,and/or selected to save on any number of other costs in performing oneor more tasks. A schema may be defined based on one or more tasks and/orpurposes associated with processing an interface identifier.

Schemas explicitly and/or implicitly define rules for a valid format ofan interface identifier and/or rules defining a vocabulary for definingvalid content of a representation of an interface identifier. A rule maydefine a constraint on the format or structure of an interfaceidentifier and/or a constraint on the content of an interfaceidentifier. Such constraints may specify or otherwise identify thresholdconditions. A threshold condition may be specified by and/or otherwisebased on a schema defining a valid protocol address to identify aprotocol endpoint for a particular network protocol. The thresholdcondition may be determined based on size information defined by theschema for representing the protocol address in the data unit of thenetwork protocol. The size information may identify at least one of amaximum size and a minimum size for a valid representation, according tothe schema, of the protocol address in the data unit.

A count of network interfaces may place a constraint on the minimum sizeof a representation of an interface identifier that is valid accordingto a specified schema. A schema may define a format rule and/or avocabulary rule that may identify a maximum count and/or a minimumcount. For example, in a schema that defines and/or otherwise allows aninterface identifier to be represented by a number, the number of digitsor number of identifiers in a suitable address space must be largeenough to accommodate the value of the count detected. In binary, asingle network interface may be represented by a single digit or bit. Acount of seven network interfaces requires an identifier space thatincludes at least seven identifiers and at least some identifiers in thespace require three digits or bits when represented in a binary or basetwo numeric representation. A schema may define and/or otherwise may beincluded in determining a constraint on the number of bits that may beused in representing an interface identifier.

In FIG. 5A, the first region 510 a 1 is illustrated with one networkinterface. A schema including a rule constraining and/or otherwiseallowing identifiers to be represented numerically may be determined byan address space condition component 404 a operating in the source node502 a to determine an identifier space that includes at least oneidentifier.

A threshold condition may be based on size information defined by theschema for representing a protocol address in the valid data unit. Thesize information may identify at least one of a maximum size and minimumsize for a valid representation of a protocol address in a data unit.

Determining an interface identifier space may include determining sizeinformation identifying at least one of a maximum size for an interfaceidentifier. The maximum size may be based on the count, for an interfaceidentifier; and determining the threshold condition based on the sizeinformation. The maximum size may be based on a schema rule.

Returning to FIG. 15, a block 1508 illustrates that the method yetfurther includes providing the first interface identifier as anidentifier of the first network interface. Accordingly, a system forassigning an interface identifier to a network interface includes meansfor providing the first interface identifier as an identifier of thefirst network interface. For example, the arrangement illustrated inFIG. 16, includes allocate component 1608 operable for and/or otherwiseincluded in providing the first interface identifier as an identifier ofthe first network interface.

An ordering of interface identifiers in an identifier space may bedetermined based on a metric. The metric may be for measuring of any ofvarious attributes accessible within an execution environment. Examplesof metrics for interface identifiers are provided above in describingthreshold conditions.

Further, an ordering of interface identifiers may correspond to anordering of network interfaces. Interface identifiers may be assignedbased on the correspondence. In an aspect, interface identifiers may beorder based on a size of their respective representations in data unitsof a network protocol. For example, an interface identifier with thevalue 1 may be represented by a single bit in a data unit. An identifierwith a value of ‘255’ may require 4 bits according to a particular typeof representation. Network interfaces in a node may be ordered based onone or more of data units sent and/or received; bytes sent and/orreceived; types of data transmission media coupled to respective networkinterface; a measure of congestion; a measure of energy or powerutilization; measure of heat; an attribute of specified protocolconfigured to communicate via the network interfaces; and a role of anext node included in a hop that includes a network interface.

Assigning an interface identifier to a first network interface in afirst node may include receiving, via the first network interface, amessage, sent via a second network interface in a second node, thatincludes criterion information to identify and/or assign an interfaceidentifier. A criterion may be based on and/or may identify any of themeasures described above. Assigning the interface identifier may furtherinclude determining that the first interface identifier meets thecriterion. A threshold condition determined by an address spacecomponent may be determined based on such a criterion. The firstinterface identifier may be assigned to the first network interface inresponse to determining that the criterion is met by the first interfaceidentifier.

In an aspect, a first node may receive data from a second node in a dataunit of a network protocol via a first network interface. The firstnetwork interface may have an assigned first interface identifier. Thedata may be received based on a protocol address of the network protocolthat includes the first interface identifier. The protocol address mayidentify a third node. In an aspect, the protocol address may include asecond interface identifier. The second interface identifier may beassigned to identify a second network interface in the first node. Thefirst node may transmit the data to the third node via the secondnetwork interface identified by the second interface identifier in theprotocol address. In another aspect, the protocol address may include athird interface identifier assigned to a third network interface in thethird node. The third network interface may be included incommunicatively coupling the first node and the third node via thesecond network interface in the first node. In an aspect, the first nodemay transmit the data to the third node via the second network interfacebased on an association between the third interface identifier and thesecond network interface.

In another aspect, a first node may receive a message via a secondnetwork interface in the first node. The message may be from a secondnode in a network path that includes the second network interface. Themessage may include and/or may be received in one or more data unitsthat include and/or identify a protocol address of a network protocol ofthe message or of the data units that include the message. The networkprotocol includes a first interface identifier assigned to a firstnetwork interface in the first node. The first node identifies the firstnetwork interface based on the first interface identifier in theprotocol address. In response, the first node may send the message to athird node in a network path from the first node, where the network pathincludes the first network interface. The protocol address may be avalid address according to the network protocol of the third node.Alternatively, the third node may be a node in a network path to adestination node identified by the protocol address.

As described in the previous paragraph, a hop may be assigned anidentifier that is shared by the pair of nodes in the hop. In stillanother aspect, a first-second protocol address may indicate a firstordering of the first interface identifier and the second interfaceidentifier. The first-second protocol address may identify the secondnode to the first node based on the first ordering. A second-firstprotocol address may include and/or otherwise indicate a second orderingof the first interface identifier. The second-first protocol address mayidentify the first node to the second node based on the second ordering.

In an additional aspect, the method illustrated in FIG. 15 may includedetecting a portion of a data unit, that is valid according to a networklayer protocol, for representing a protocol address. The protocoladdress may identify a sender and/or a receiver of data included in thedata unit. A hop threshold size may be determined for including arepresentation of a hop identifier in the detected portion. The hopthreshold size may be determined based on a size of the hop identifier.A representation of the hop identifier may be stored in a hop locationwhere the hop location has a size that meets a threshold condition basedon the hop size.

The method illustrated in FIG. 15 may include additional aspectssupported by various adaptations and/or analogs of the arrangement ofcomponents in FIG. 16. In an aspect, the method may include determiningthat a protocol address, that is specified according to a networkprotocol, includes a first interface identifier assigned to a firstnetwork interface. Further, the method may include determining that theprotocol address includes an identifier of a second node in a networkpath that includes the first network interface. Determining that thesecond node is included in the network path that includes the firstnetwork interface may be based on the first interface identifier. Thefirst interface identifier may identify the first network interface totransmit a data unit, of the network protocol, that includes and/orotherwise identifies the protocol address.

In another aspect a count may be detected by a count component based onwhether a network interface in the region is in a node configured to atleast one of send and receive a data unit specified according to anetwork protocol.

An address space condition component may determine a threshold conditionbased on an interface identifier space to identify a protocol endpointof a network protocol. Determining the threshold condition may includedetermining, based on the count, a maximum count of interfaceidentifiers in the interface identifier space

Further, a threshold condition may be based on a metric to measure anaddress portion of a data unit, of a network protocol, in a datatransmission when transmitted via a data transmission medium. Thethreshold condition may be based on a metric to measure a size of aninterface identifier in a protocol address when stored in the addressportion.

In a further aspect identifying an interface identifier may includeidentifying an interface identifier space based on a thresholdcondition. The interface identifier interface identifier may be selectedfrom the interface identifier space for assigning to a networkinterface.

In another aspect a first node may receive data, from a second node viaa first network interface, in a data unit including a protocol address,of a protocol endpoint of a network protocol, that includes a firstinterface identifier of the first network interface. The protocoladdress may be a valid identifier of a third node that is included in anetwork path that includes a second network interface in the first node.The first node may send the data to the third node via the secondnetwork interface. The protocol address includes a second interfaceidentifier assigned to identify the second network interface.

An interface identifier may be assigned to a first network interface ina first region in a node including a second network interface in asecond region of a network. Assigning the first network interface mayinclude determining that the first interface identifier is the smallestavailable interface identifier.

The invention claimed is:
 1. A non-transitory computer-readable mediastoring instructions, that when executed by one or more processors of atopology node, cause the topology node to: identify a policy, based on afirst algorithm and a second algorithm, for use in constraining datarouting from a first node to a second node; identify, based on the firstalgorithm, a first sequence of identifiers for data routing in a networkfrom the first node in the network to one or more path nodes, where thenetwork includes a label switching network or an Internet Protocolversion 6 (IPv6) network; identify, based on the second algorithm, asecond sequence of identifiers for data routing in the network from atleast one of the one or more path nodes in the network to the secondnode; include the first sequence of identifiers identified based on thefirst algorithm and the second sequence of identifiers identified basedon the second algorithm in a third sequence of identifiers that reflectsthe policy such that data routing is constrained from the first node tothe second node via a plurality of network paths that each include atleast one node in the network; and provide path information thatidentifies the third sequence of identifiers that includes the firstsequence of identifiers identified based on the first algorithm and thesecond sequence of identifiers identified based on the second algorithm,for constraining data routing, according to the policy, to the secondnode via the at least one of the one or more path nodes, such that thedata routing from the first node to the at least one of the one or morepath nodes is constrained based on the first algorithm and the datarouting from the at least one of the one or more path nodes to thesecond node is constrained based on the second algorithm.
 2. Thenon-transitory computer-readable media of claim 1, wherein the pathinformation is provided to the first node, for constraining datarouting, according to the policy, to the second node via the at leastone of the one or more path nodes.
 3. The non-transitorycomputer-readable media of claim 1, wherein the at least one node in thenetwork, includes the at least one of the one or more path nodes.
 4. Thenon-transitory computer-readable media of claim 1, wherein theinstructions, when executed by the one or more processors of thetopology node, cause the topology node to operate so data that isreceived in each packet by the second node from the first node utilizingthe third sequence of identifiers traverses a particular network pathselected, from the plurality of network paths at least in part, by aparticular node in the particular network path based on an identifier inthe third sequence that is identified as an active identifier for theparticular node.
 5. The non-transitory computer-readable media of claim1, wherein the instructions, when executed by the one or more processorsof the topology node, cause the topology node to operate so that thefirst node includes a source node and the second node includes adestination node.
 6. The non-transitory computer-readable media of claim1, wherein the instructions, when executed by the one or more processorsof the topology node, cause the topology node to operate so that atleast one of the first node or the second node includes a boundary nodeof the network.
 7. The non-transitory computer-readable media of claim1, wherein the instructions, when executed by the one or more processorsof the topology node, cause the topology node to operate so that atleast one of the first sequence of identifiers or the second sequence ofidentifiers is identified based on data received.
 8. The non-transitorycomputer-readable media of claim 1, wherein the instructions, whenexecuted by the one or more processors of the topology node, cause thetopology node to operate so that at least one of the first sequence ofidentifiers or the second sequence of identifiers is identified based ondata received from another topology node.
 9. The non-transitorycomputer-readable media of claim 1, wherein the instructions, whenexecuted by the one or more processors of the topology node, cause thetopology node to operate so that the at least one of the one or morepath nodes is identified by a node-specific identifier.
 10. Thenon-transitory computer-readable media of claim 9, wherein thenode-specific identifier includes a region scoped identifier.
 11. Thenon-transitory computer-readable media of claim 9, wherein thenode-specific identifier includes a region-specific identifier.
 12. Thenon-transitory computer-readable media of claim 9, wherein thenode-specific identifier includes an outside scope identifier.
 13. Thenon-transitory computer-readable media of claim 9, wherein thenode-specific identifier does not identify a network interface of the atleast one of the one or more path nodes.
 14. The non-transitorycomputer-readable media of claim 1, wherein the instructions, whenexecuted by the one or more processors of the topology node, cause thetopology node to operate so that the at least one of the one or morepath nodes is identified by a region scoped identifier.
 15. Thenon-transitory computer-readable media of claim 1, wherein theinstructions, when executed by the one or more processors of thetopology node, cause the topology node to operate so that the at leastone of the one or more path nodes is identified by a region-specificidentifier.
 16. The non-transitory computer-readable media of claim 1,wherein the instructions, when executed by the one or more processors ofthe topology node, cause the topology node to operate so that the atleast one of the one or more path nodes is identified by an outsidescope identifier.
 17. The non-transitory computer-readable media ofclaim 1, wherein the instructions, when executed by the one or moreprocessors of the topology node, cause the topology node to operate sothat the at least one of the one or more path nodes is identified by anidentifier that does not identify a network interface of the at leastone of the one or more path nodes.
 18. The non-transitorycomputer-readable media of claim 1, wherein the instructions, whenexecuted by the one or more processors of the topology node, cause thetopology node to operate so that first topology data is receivedincluding a first identifier in an identifier space that spans aparticular region of the network that includes the first node.
 19. Thenon-transitory computer-readable media of claim 18, wherein theinstructions, when executed by the one or more processors of thetopology node, cause the topology node to operate so that, when theparticular region spans within the first node, the first identifier isconfigured for use in identifying one of: a network interface of thefirst node that is included in at least one network path segment thatcommunicatively couples the first node and the at least one of the oneor more path nodes in the network, a network interface of the at leastone of the one or more path nodes, or at least one network path segmentto the at least one of the one or more path nodes where the firstidentifier does not include any identifier of any particular networkinterface of the at least one of the one or more path nodes.
 20. Thenon-transitory computer-readable media of claim 18, wherein theinstructions, when executed by the one or more processors of thetopology node, cause the topology node to operate so that, when theparticular region spans a plurality of nodes, the first identifier isconfigured for use in identifying one of: a network interface of the atleast one of the one or more path nodes that is in the particularregion, a network interface of the at least one of the one or more pathnodes that is not in the particular region, or at least one path segmentto the at least one of the one or more path nodes where the firstidentifier does not include any identifier of any particular networkinterface of the at least one of the one or more path nodes.
 21. Thenon-transitory computer-readable media of claim 1, wherein theinstructions, when executed by the one or more processors of thetopology node, cause the topology node to operate so that at least oneof the first sequence of identifiers or the second sequence ofidentifiers is identified based on topology data including an identifierthat includes or that is mappable to a particular node-specificidentifier in an identifier space that spans within a particular nodeand that is for use by the particular node.
 22. The non-transitorycomputer-readable media of claim 21, wherein the instructions, whenexecuted by the one or more processors of the topology node, cause thetopology node to operate so that the identifier that is for use by theparticular node, is for identifying one of: a network interface of aspecific node in a specific network path that communicatively couplesthe first node and the at least one of the one or more path nodes in thenetwork, or at least one network path segment to at least one node thatcommunicatively couples the first node and the at least one of the oneor more path nodes where the particular node-specific identifier doesnot include, for use by the particular node, any identifier of anyparticular network interface of the at least one of the one or more pathnodes.
 23. The non-transitory computer-readable media of claim 21,wherein the instructions, when executed by the one or more processors ofthe topology node, cause the topology node to operate so that the thirdsequence of identifiers reflects the policy, by encoding the policy. 24.The non-transitory computer-readable media of claim 1, wherein theinstructions, when executed by the one or more processors of thetopology node, cause the topology node to operate so that at least oneof: hop information and protocol addresses are detected by the topologynode; hop information and protocol addresses are reported to thetopology node; the topology node creates a representation of a topologyof some or all of the network; the topology node updates arepresentation of a topology of some or all of the network; the topologynode maintains a representation of a topology of some or all of thenetwork; the topology node is included in a group of topology nodes in atopology service or system; the topology node maintains a representationof a topology for a portion of the network or for an entirety of thenetwork; the topology node includes a topology execution environment;the topology node includes an execution environment that hosts atopology service or a portion thereof; the topology node includes one ormore nodes; the topology node is hosted by one or more nodes; thetopology node is a part of a topology system; the topology node is apart of a system including topology nodes organized as a hierarchy oftopology nodes that maintain a hierarchy of representations ofrespective portions of a topology of the network; the topology node is apart of a peer-to-peer system; the third sequence of identifiersreflects the policy, by encoding the policy; the phrases instructions,one or more processors, and topology node all do not invoke 35 U.S.C.112, sixth paragraph; the network includes the label switching network;the network includes the IPv6 network; the network is the labelswitching network; the network is the IPv6 network; at least one of thefirst algorithm or the second algorithm, involves at least one metric;the first algorithm involves a first metric, and the second algorithminvolves a second metric; at least one of the first algorithm or thesecond algorithm, involves at least one rule; the first algorithminvolves a first rule, and the second algorithm involves a second rule;the policy that is identified based on the first algorithm and thesecond algorithm, is a single policy; the policy that is identifiedbased on the first algorithm and the second algorithm, includes multiplepolicies; the path information is provided for being identified using aheader, by being identified via a look up based on contents of theheader; the path information is provided for being identified using theheader, by being identified via a look up, in a location separate fromthe header, based on contents of the header; the path information isprovided for being identified using the header, by being included in theheader; the path information is provided for being used by the at leastone of the one or more path nodes; the topology node includes an ingressnode; the topology node includes a source node; the topology node is inthe network; the topology node is outside the network; the topology nodeis part of the first node; the topology node is separate from the firstnode; the topology node includes the first node; the first node includesthe topology node; at least one of the first sequence of identifiers orthe second sequence of identifiers is identified based on networktopology information that is received; at least one of the firstsequence of identifiers or the second sequence of identifiers isidentified based by receiving the same via an input device in responseto a user input; at least one of the first sequence of identifiers orthe second sequence of identifiers is automatically generated; thenetwork includes a label switching network that is a Multiprotocol LabelSwitching (MPLS) network; data routing is constrained from the firstnode to the second node via the plurality of network paths, in anon-deterministic manner; data routing is constrained from the firstnode to the second node via the plurality of network paths, at least inpart, in a non-deterministic manner; the path information includes thethird sequence of identifiers; the path information is configured foruse in identifying the third sequence of identifiers; the pathinformation is configured for use in identifying the third sequence ofidentifiers, by looking up the third sequence of identifiers; the atleast one node in the network of each of the plurality of network pathseach include different nodes in the network; the at least one node inthe network of each of the plurality of network paths each include atleast one common node in the network; the plurality of network pathseach include different nodes in the network; or the plurality of networkpaths each include at least one common node in the network.
 25. Asystem, comprising; network means for data routing, where the networkmeans includes a label switching network or an Internet Protocol version6 (IPv6) network; and topology node means for: identifying a policy,based on a first algorithm and a second algorithm, for use inconstraining data routing from a first node to a second node;identifying, based on the first algorithm, a first sequence ofidentifiers for data routing in the network means from the first node inthe network means to one or more path nodes; identifying, based on thesecond algorithm, a second sequence of identifiers for data routing inthe network means from at least one of the one or more path nodes in thenetwork means to the second node; including the first sequence ofidentifiers identified based on the first algorithm and the secondsequence of identifiers identified based on the second algorithm in athird sequence of identifiers that reflects the policy such that datarouting is constrained from the first node to the second node via aplurality of network paths that each include at least one node in thenetwork means; and providing path information that identifies the thirdsequence of identifiers that includes the first sequence of identifiersidentified based on the first algorithm and the second sequence ofidentifiers identified based on the second algorithm, for constrainingdata routing, according to the policy, to the second node via the atleast one of the one or more path nodes, such that the data routing fromthe first node to the at least one of the one or more path nodes isconstrained based on the first algorithm and the data routing from theat least one of the one or more path nodes to the second node isconstrained based on the second algorithm.
 26. A method, comprising: ata topology node: identifying a policy, based on a first algorithm and asecond algorithm, for use in constraining data routing from a first nodeto a second node; identifying, based on the first algorithm, a firstsequence of identifiers for data routing in a network from the firstnode in the network to one or more path nodes, where the networkincludes a label switching network or an Internet Protocol version 6(IPv6) network; identifying, based on the second algorithm, a secondsequence of identifiers for data routing in the network from at leastone of the one or more path nodes in the network to the second node;including the first sequence of identifiers identified based on thefirst algorithm and the second sequence of identifiers identified basedon the second algorithm in a third sequence of identifiers that reflectsthe policy such that data routing is constrained from the first node tothe second node via a plurality of network paths that each include atleast one node in the network; and providing path information thatidentifies the third sequence of identifiers that includes the firstsequence of identifiers identified based on the first algorithm and thesecond sequence of identifiers identified based on the second algorithm,for constraining data routing, according to the policy, to the secondnode via the at least one of the one or more path nodes, such that thedata routing from the first node to the at least one of the one or morepath nodes is constrained based on the first algorithm and the datarouting from the at least one of the one or more path nodes to thesecond node is constrained based on the second algorithm.
 27. A methodfor configuring a topology node, comprising: communicatively coupling atleast one non-transitory memory and one or more processors; and causingstorage of instructions on the at least one non-transitory memory wherethe instructions are configured to cause the topology node to: identifya policy, based on a first algorithm and a second algorithm, for use inconstraining data routing from a first node to a second node; identify,based on the first algorithm, a first sequence of identifiers for datarouting in a network from the first node in the network to one or morepath nodes, where the network includes a label switching network or anInternet Protocol version 6 (IPv6) network; identify, based on thesecond algorithm, a second sequence of identifiers for data routing inthe network from at least one of the one or more path nodes in thenetwork to the second node; include the first sequence of identifiersidentified based on the first algorithm and the second sequence ofidentifiers identified based on the second algorithm in a third sequenceof identifiers that reflects the policy such that data routing isconstrained from the first node to the second node via a plurality ofnetwork paths that each include at least one node in the network; andprovide path information that identifies the third sequence ofidentifiers that includes the first sequence of identifiers identifiedbased on the first algorithm and the second sequence of identifiersidentified based on the second algorithm, for constraining data routing,according to the policy, to the second node via the at least one of theone or more path nodes, such that the data routing from the first nodeto the at least one of the one or more path nodes is constrained basedon the first algorithm and the data routing from the at least one of theone or more path nodes to the second node is constrained based on thesecond algorithm.
 28. A method, comprising: performing at least one actthat is configured to cause a topology node to: identify a policy, basedon a first algorithm and a second algorithm, for use in constrainingdata routing from a first node to a second node; identify, based on thefirst algorithm, a first sequence of identifiers for data routing in anetwork from the first node in the network to one or more path nodes,where the network includes a label switching network or an InternetProtocol version 6 (IPv6) network; identify, based on the secondalgorithm, a second sequence of identifiers for data routing in thenetwork from at least one of the one or more path nodes in the networkto the second node; include the first sequence of identifiers identifiedbased on the first algorithm and the second sequence of identifiersidentified based on the second algorithm in a third sequence ofidentifiers that reflects the policy such that data routing isconstrained from the first node to the second node via a plurality ofnetwork paths that each include at least one node in the network; andprovide path information that identifies the third sequence ofidentifiers that includes the first sequence of identifiers identifiedbased on the first algorithm and the second sequence of identifiersidentified based on the second algorithm, for constraining data routing,according to the policy, to the second node via the at least one of theone or more path nodes, such that the data routing from the first nodeto the at least one of the one or more path nodes is constrained basedon the first algorithm and the data routing from the at least one of theone or more path nodes to the second node is constrained based on thesecond algorithm; and causing storage of a result of the at least oneact on at least one non-transitory memory.
 29. The method of claim 28,wherein the path information is provided to the first node, forconstraining data routing, according to the policy, to the second nodevia the at least one of the one or more path nodes.
 30. The method ofclaim 28, wherein the at least one node in the network, includes the atleast one of the one or more path nodes.
 31. The method of claim 28, andcomprising: performing at least one additional act that is configured tocause the topology node to operate so data that is received in eachpacket by the second node from the first node utilizing the thirdsequence of identifiers traverses a particular network path selected,from the plurality of network paths at least in part, by a particularnode in the particular network path based on an identifier in the thirdsequence that is identified as an active identifier for the particularnode.
 32. The method of claim 28, and comprising: performing at leastone additional act that is configured to cause the topology node tooperate such that the first node includes a source node and the secondnode includes a destination node.
 33. The method of claim 28, andcomprising: performing at least one additional act that is configured tocause the topology node to operate such that at least one of the firstnode or the second node includes a boundary node of the network.
 34. Themethod of claim 28, and comprising: performing at least one additionalact that is configured to cause the topology node to operate such thatat least one of the first sequence of identifiers or the second sequenceof identifiers is identified based on data received.
 35. The method ofclaim 28, and comprising: performing at least one additional act that isconfigured to cause the topology node to operate such that at least oneof the first sequence of identifiers or the second sequence ofidentifiers is identified based on data received from another topologynode.
 36. The method of claim 28, and comprising: performing at leastone additional act that is configured to cause the topology node tooperate such that the at least one of the one or more path nodes isidentified by a node-specific identifier.
 37. The method of claim 36,wherein the node-specific identifier includes a region scopedidentifier.
 38. The method of claim 36, wherein the node-specificidentifier includes a region-specific identifier.
 39. The method ofclaim 36, wherein the node-specific identifier includes an outside scopeidentifier.
 40. The method of claim 36, wherein the node-specificidentifier does not identify a network interface of the at least one ofthe one or more path nodes.
 41. The method of claim 28, and comprising:performing at least one additional act that is configured to cause thetopology node to operate such that the at least one of the one or morepath nodes is identified by a region scoped identifier.
 42. The methodof claim 28, and comprising: performing at least one additional act thatis configured to cause the topology node to operate such that the atleast one of the one or more path nodes is identified by aregion-specific identifier.
 43. The method of claim 28, and comprising:performing at least one additional act that is configured to cause thetopology node to operate such that the at least one of the one or morepath nodes is identified by an outside scope identifier.
 44. The methodof claim 28, and comprising: performing at least one additional act thatis configured to cause the topology node to operate such that the atleast one of the one or more path nodes is identified by an identifierthat does not identify a network interface of the at least one of theone or more path nodes.
 45. The method of claim 28, and comprising:performing at least one additional act that is configured to cause thetopology node to operate such that first topology data is receivedincluding a first identifier in an identifier space that spans aparticular region of the network that includes the first node.
 46. Themethod of claim 45, and comprising: performing at least one additionalact that is configured to cause the topology node to operate such that,based on the particular region spanning within the first node, the firstidentifier is configured for use in identifying one of: a networkinterface of the first node that is included in at least one networkpath segment that communicatively couples the first node and the atleast one of the one or more path nodes in the network, a networkinterface of the at least one of the one or more path nodes, or at leastone network path segment to the at least one of the one or more pathnodes where the first identifier does not include any identifier of anyparticular network interface of the at least one of the one or more pathnodes.
 47. The method of claim 45, and comprising: performing at leastone additional act that is configured to cause the topology node tooperate such that, based on the particular region spanning a pluralityof nodes, the first identifier is configured for use in identifying oneof: a network interface of the at least one of the one or more pathnodes that is in the particular region, a network interface of the atleast one of the one or more path nodes that is not in the particularregion, or at least one path segment to the at least one of the one ormore path nodes where the first identifier does not include anyidentifier of any particular network interface of the at least one ofthe one or more path nodes.
 48. The method of claim 28, and comprising:performing at least one additional act that is configured to cause thetopology node to operate such that at least one of the first sequence ofidentifiers or the second sequence of identifiers is identified based ontopology data including an identifier that includes or that is mappableto a particular node-specific identifier in an identifier space thatspans within a particular node and that is for use by the particularnode.
 49. The method of claim 48, and comprising: performing at leastone additional act that is configured to cause the topology node tooperate such that the identifier that is for use by the particular node,is for identifying one of: a network interface of a specific node in aspecific network path that communicatively couples the first node andthe at least one of the one or more path nodes in the network, or atleast one network path segment to at least one node that communicativelycouples the first node and the at least one of the one or more pathnodes where the particular node-specific identifier does not include,for use by the particular node, any identifier of any particular networkinterface of the at least one of the one or more path nodes.
 50. Themethod of claim 48, and comprising: performing at least one additionalact that is configured to cause the topology node to operate such thatthe third sequence of identifiers reflects the policy, by encoding thepolicy.
 51. The method of claim 50, at least one of: hop information andprotocol addresses are detected by the topology node; hop informationand protocol addresses are reported to the topology node; the topologynode creates a representation of a topology of some or all of thenetwork; the topology node updates a representation of a topology ofsome or all of the network; the topology node maintains a representationof a topology of some or all of the network; the topology node isincluded in a group of topology nodes in a topology service or system;the topology node maintains a representation of a topology for a portionof the network or for an entirety of the network; the topology nodeincludes a topology execution environment; the topology node includes anexecution environment that hosts a topology service or a portionthereof; the topology node includes one or more nodes; the topology nodeis hosted by one or more nodes; the topology node is a part of atopology system; the topology node is a part of a system includingtopology nodes organized as a hierarchy of topology nodes that maintaina hierarchy of representations of respective portions of a topology ofthe network; the topology node is a part of a peer-to-peer system; thethird sequence of identifiers reflects the policy, by encoding thepolicy; the network includes the label switching network; the networkincludes the IPv6 network; the network is the label switching network;the network is the IPv6 network; at least one of the first algorithm orthe second algorithm, involves at least one metric; the first algorithminvolves a first metric, and the second algorithm involves a secondmetric; at least one of the first algorithm or the second algorithm,involves at least one rule; the first algorithm involves a first rule,and the second algorithm involves a second rule; the policy that isidentified based on the first algorithm and the second algorithm, is asingle policy; the policy that is identified based on the firstalgorithm and the second algorithm, includes multiple policies; the pathinformation is provided for being identified using a header, by beingidentified via a look up based on contents of the header; the pathinformation is provided for being identified using the header, by beingidentified via a look up, in a location separate from the header, basedon contents of the header; the path information is provided for beingidentified using the header, by being included in the header; the pathinformation is provided for being used by the at least one of the one ormore path nodes; the topology node includes an ingress node; thetopology node includes a source node; the topology node is in thenetwork; the topology node is outside the network; the topology node ispart of the first node; the topology node is separate from the firstnode; the topology node includes the first node; the first node includesthe topology node; at least one of the first sequence of identifiers orthe second sequence of identifiers is identified based on networktopology information that is received; at least one of the firstsequence of identifiers or the second sequence of identifiers isidentified based by receiving the same via an input device in responseto a user input; at least one of the first sequence of identifiers orthe second sequence of identifiers is automatically generated; thenetwork includes a label switching network that is a Multiprotocol LabelSwitching (MPLS) network; data routing is constrained from the firstnode to the second node via the plurality of network paths, in anon-deterministic manner; data routing is constrained from the firstnode to the second node via the plurality of network paths, at least inpart, in a non-deterministic manner; the path information includes thethird sequence of identifiers; the path information is configured foruse in identifying the third sequence of identifiers; the pathinformation is configured for use in identifying the third sequence ofidentifiers, by looking up the third sequence of identifiers; the atleast one node in the network of each of the plurality of network pathseach include different nodes in the network; the at least one node inthe network of each of the plurality of network paths each include atleast one common node in the network; the plurality of network pathseach include different nodes in the network; the plurality of networkpaths each include at least one common node in the network; the at leastone act is performed at the topology node; the at least one act isperformed at a certain node other than the topology node; the at leastone act and the at least one additional act are performed at thetopology node; the at least one act and the at least one additional actare performed at a certain node other than the topology node; the atleast one act and the at least one additional act are performed at acertain node other than the topology node; the at least one act and theat least one additional act are performed at a certain node other thanthe topology node; at least one of the at least one act or the at leastone additional act includes a configuration; at least one of the atleast one act or the at least one additional act includes aconfiguration of instructions; the at least one act causes the topologynode to perform each instance of the identification, the inclusion, andthe providing; the at least one act causes the topology node to performat least one of: at least one instance of the identification, theinclusion, or the providing; the at least one act causes at least oneoperation to be performed other than each instance of theidentification, the inclusion, and the providing; the causing storageincludes causing storage of at least portion of instructions on the atleast one non-transitory memory for being accessible to a user so thatthe user is capable of installing the at least portion of theinstructions on other memory of the topology node, for execution; thecausing storage includes causing storage of at least portion ofinstructions on the at least one non-transitory memory, that is part ofthe topology node; the causing storage includes causing storage of atleast portion of instructions on the at least one non-transitory memory,that is part of the topology node, so that the topology node is providedto a user for use; the causing storage includes installation; thecausing storage includes causing transfer of at least portion ofinstructions from persistent storage to volatile memory; the at leastone non-transitory memory includes a register; the at least onenon-transitory memory includes volatile memory; the at least onenon-transitory memory includes persistent storage; the method furthercomprises configuring the topology node; the method further comprisescoupling the at least one non-transitory memory to one or moreprocessors; the method further comprises providing the topology node;the method further comprises providing the at least one non-transitorymemory; the method further comprises providing one or more processors;the at least one non-transitory memory is part of the topology node; orthe at least one non-transitory memory is separate from topology nodememory of the topology node.